Fast Convergence of Distance-based Inconsistency in Pairwise Comparisons

Citations Over TimeTop 10% of 2015 papers

Abstract

This study presents theoretical proof and empirical evidence of the reduction algorithm convergence for the distance-based inconsistency in pairwise comparisons. Our empirical research shows that the convergence very quick. It usually takes less than 10 reductions to bring the inconsistency of the pairwise comparisons matrix below the assumed threshold of 1/3 (sufficient for most applications). We believe that this is the first Monte Carlo study demonstrating such results for the convergence speed of inconsistency reduction in pairwise comparisons.

Related Papers

• → Prim�rzerlegung in Steinschen Algebren(1964)32 cited
• → Incomplete Large-Dimensional Pairwise Comparison Matrices(2018)2 cited
• → The validity of pairwise models in predicting community dynamics(2016)3 cited
• → Pairwise Comparisons Simplified(2013)
• → ИСПОЛЬЗОВAНИЕ ПОТЕНЦИAЛA СОЦИAЛЬНЫХ ПAРТНЕРОВ В ПОДГОТОВКЕ БУДУЩИХ ПЕДAГОГОВ(2024)