Computing a consistent approximation to a generalized pairwise comparisons matrix

From MaRDI portal





The authors introduce an algorithm of complexity \(O(n^2)\) for computing a consistent approximation to a generalized pairwise comparisons matrix. The algorithm is based on a logarithmic transformation of the matrix into a linear space with the Euclidean metric. It uses both the row and (reciprocals of) column geometric means. The resulting approximation is optimal and consistent.




Cited in
(25)


Describes a project that uses

Uses Software






This page was built for publication: Computing a consistent approximation to a generalized pairwise comparisons matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962971)