The limit of inconsistency reduction in pairwise comparisons

Abstract

Abstract This study provides a proof that the limit of a distance-based inconsistency reduction process is a matrix induced by the vector of geometric means of rows when a distance-based inconsistent pairwise comparisons matrix is transformed into a consistent PC matrix by stepwise inconsistency reduction in triads. The distance-based inconsistency indicator was defined by Koczkodaj (1993) for pairwise comparisons. Its convergence was analyzed in 1996 (regretfully, with an incomplete proof) and finally completed in 2010. However, there was no interpretation provided for the limit of convergence despite its considerable importance. This study also demonstrates that the vector of geometric means and the right principal eigenvector are linearly independent for the pairwise comparisons matrix size greater than three, although both vectors are identical (when normalized) for a consistent PC matrix of any size.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 32 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.