An Algorithm for the Optimal Consistent Approximation to a Pairwise Comparisons Matrix by Orthogonal Projections

Abstract

The algorithm for finding the optimal consistent approximation of an inconsistent pairwise comparisons matrix is based on a logarithmic transformation of a pairwise comparisons matrix into a vector space with the Euclidean metric. Orthogonal basis is introduced in the vector space. The orthogonal projection of the transformed matrix onto the space formed by the images of consistent matrices is the required consistent approximation.

Cited by in corpus (7)

• Combating harmful Internet use with peer assessment and differential evolution
• Almost optimal manipulation of a pair of alternatives
• On Orthogonal Projections on the Space of Consistent Pairwise Comparisons Matrices
• Pairwise Comparisons Matrix Decomposition into Approximation and Orthogonal Component Using Lie Theory
• Computationally efficient orthogonalization for pairwise comparisons method
• Detection of decision-making manipulation in the pairwise comparisons method
• A Multiresolution Analysis Framework for the Statistical Analysis of Incomplete Rankings