English

Pairwise Comparisons Simplified

Discrete Mathematics 2015-01-27 v1 Computer Science and Game Theory

Abstract

This study examines the notion of generators of a pairwise comparisons matrix. Such approach decreases the number of pairwise comparisons from n(n1)n\cdot (n-1) to n1n-1. An algorithm of reconstructing of the PC matrix from its set of generators is presented.

Cite

@article{arxiv.1311.6863,
  title  = {Pairwise Comparisons Simplified},
  author = {W. W. Koczkodaj and J. Szybowski},
  journal= {arXiv preprint arXiv:1311.6863},
  year   = {2015}
}

Comments

15 pages, two figures

R2 v1 2026-06-22T02:15:39.001Z