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. Issue 4 (19th May 2019)

• Record Type: Journal Article
• Authors: Bozóki, Sándor; Tsyganok, Vitaliy
• Is Part Of: International journal of general systems. Volume 48:Issue 4(2019)
• Page Start: 362
• Page End: 381
• Publication Date: 2019-05-19
• Subjects: Decision analysis -- multi-criteria decision making -- incomplete pairwise comparison matrix -- additive -- multiplicative -- least squares -- logarithmic least squares -- Laplacian matrix -- spanning tree; System theory -- Periodicals; 003
• DOI: 10.1080/03081079.2019.1585432
• Languages: English
• ISSNs: 0308-1079

Abstract

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.