A Numerical Comparison of Iterative Algorithms for Inconsistency Reduction in Pairwise Comparisons

• Main Authors: Jiri Mazurek, Radomir Perzina, Dominik Strzalka, Bartosz Kowal, Pawel Kuras
• Format: Article
• Language: English
• Published: IEEE 2021-01-01
• Series: IEEE Access
• Subjects: Algorithm; consistency; inconsistency reduction; pairwise comparisons
• Online Access: https://ieeexplore.ieee.org/document/9408608/

The aim of this paper is to compare selected iterative algorithms for inconsistency reduction in pairwise comparisons by Monte Carlo simulations. We perform simulations for pairwise comparison matrices of the order <inline-formula> <tex-math notation="LaTeX">$n = 4 $ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$n = 8 $ </tex-math></inline-formula> with the initial inconsistency <inline-formula> <tex-math notation="LaTeX">$0.10 &lt; CR &lt; 0.80 $ </tex-math></inline-formula> and entries drawn from Saaty&#x2019;s fundamental scale. Subsequently, we evaluate the algorithms&#x2019; performance with respect to four measures that express the degree of original preference preservation. Our results indicate that no algorithm outperforms all other algorithms with respect to every measure of preference preservation. The Xu and Wei&#x2019;s algorithm is the best with regard to the preservation of an original priority vector and the ranking of objects, the Step-by-Step algorithm best preserves the original preferences expressed in the form of a pairwise comparison matrix, and the algorithm of Szybowski keeps the most matrix entries unchanged during inconsistency reduction.