Computing a consistent approximation to a generalized pairwise comparisons matrix

This paper presents an algorithm for computing a consistent approximation to a generalized pairwise comparisons matrix (that is, without the reciprocity property or even 1s on the main diagonal). The algorithm is based on a logarithmic transformation of the generalized pairwise comparisons matrix into a linear space with the Euclidean metric. It uses both the row and (reciprocals of) column geometric means and is thus a generalization of the ordinary geometric means method. The resulting approximation is not only consistent, but also closest to the original matrix, i.e., deviates least from an expertʹs original judgments. The computational complexity of the algorithm is O(n2).