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
From MaRDI portal
Publication:6281979
DOI10.1080/03081079.2019.1585432arXiv1701.04265WikidataQ128181729 ScholiaQ128181729MaRDI QIDQ6281979FDOQ6281979
Authors: Sándor Bozóki, Vitaliy Tsyganok 
Publication date: 16 January 2017
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.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Management decision making, including multiple objectives (90B50) Applications of graph theory to circuits and networks (94C15)
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6281979)
