The limit of inconsistency reduction in pairwise comparisons

34Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

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

CITATION STYLE

APA

Koczkodaj, W. W., & Szybowski, J. (2016). The limit of inconsistency reduction in pairwise comparisons. International Journal of Applied Mathematics and Computer Science, 26(3), 721–729. https://doi.org/10.1515/amcs-2016-0050

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free