The (logarithmic) least squares optimality of the arithmetic (geometric) mean of weight vectors calculated from all spanning trees for incomplete additive (multiplicative) pairwise comparison matrices
arXiv:1701.04265 · doi:10.1080/03081079.2019.1585432
Abstract
Complete and incomplete additive/multiplicative pairwise comparison matrices are applied in preference modelling, multi-attribute decision making and ranking. The equivalence of two well known methods is proved in this paper. The arithmetic (geometric) mean of weight vectors, calculated from all spanning trees, is proved to be optimal to the (logarithmic) least squares problem, not only for complete, as it was recently shown in Lundy, M., Siraj, S., Greco, S. (2017): The mathematical equivalence of the "spanning tree" and row geometric mean preference vectors and its implications for preference analysis, European Journal of Operational Research 257(1) 197-208, but for incomplete matrices as well. Unlike the complete case, where an explicit formula, namely the row arithmetic/geometric mean of matrix elements, exists for the (logarithmic) least squares problem, the incomplete case requires a completely different and new proof. Finally, Kirchhoff's laws for the calculation of potentials in electric circuits is connected to our results.
21 pages, 6 figures
References in corpus (2)
Cited by in corpus (16)
- University rankings from the revealed preferences of the applicants
- Inconsistency indices for incomplete pairwise comparisons matrices
- On the geometric mean method for incomplete pairwise comparisons
- Axiomatizations of inconsistency indices for triads
- On the monotonicity of the eigenvector method
- An alternative quality of life ranking on the basis of remittances
- Revenue allocation in Formula One: a pairwise comparison approach
- A lexicographically optimal completion for pairwise comparison matrices with missing entries
- Right-left asymmetry of the eigenvector method: A simulation study
- The incomplete Analytic Hierarchy Process and Bradley-Terry model: (in)consistency and information retrieval
- How to choose a completion method for pairwise comparison matrices with missing entries: An axiomatic result
- On the Derivation of Weights from Incomplete Pairwise Comparisons Matrices via Spanning Trees with Crisp and Fuzzy Confidence Levels
- The logarithmic least squares priorities and ordinal violations in the best-worst method
- Optimal sequences for pairwise comparisons: the graph of graphs approach
- Almost optimal manipulation of a pair of alternatives
- Incomplete Analytic Hierarchy Process with Minimum Weighted Ordinal Violations