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

J 2021

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

MAZUREK, Jiří, Radomír PERZINA, Dominik STRZALKA, Bartosz KOWAL, Pawel KURAS et. al.

Basic information

Original name

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

Authors

MAZUREK, Jiří (203 Czech Republic, guarantor, belonging to the institution), Radomír PERZINA (203 Czech Republic, belonging to the institution), Dominik STRZALKA (616 Poland), Bartosz KOWAL (616 Poland) and Pawel KURAS (616 Poland)

Edition

IEEE Access, 2021, 2169-3536

Other information

Language

English

Type of outcome

Článek v odborném periodiku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

United States of America

Confidentiality degree

není předmětem státního či obchodního tajemství

References:

URL

RIV identification code

RIV/47813059:19520/21:A0000242

Organization unit

School of Business Administration in Karvina

DOI

http://dx.doi.org/10.1109/ACCESS.2021.3074274

UT WoS

000645843700001

Keywords in English

Algorithm; consistency; inconsistency reduction; pairwise comparisons

Abstract

V originále

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 n = 4 and n = 8 with the initial inconsistency 0.10 <; CR <; 0.80 and entries drawn from Saaty's fundamental scale. Subsequently, we evaluate the algorithms' 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'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.

Citovat

MAZUREK, Jiří, Radomír PERZINA, Dominik STRZALKA, Bartosz KOWAL and Pawel KURAS. A Numerical Comparison of Iterative Algorithms for Inconsistency Reduction in Pairwise Comparisons. IEEE Access. 2021, vol. 9, není, p. 62553-62561. ISSN 2169-3536. Available from: https://dx.doi.org/10.1109/ACCESS.2021.3074274.

@article{55150,
   author = {Mazurek, Jiří and Perzina, Radomír and Strzalka, Dominik and Kowal, Bartosz and Kuras, Pawel},
   article_number = {není},
   doi = {http://dx.doi.org/10.1109/ACCESS.2021.3074274},
   keywords = {Algorithm; consistency; inconsistency reduction; pairwise comparisons},
   language = {eng},
   issn = {2169-3536},
   journal = {IEEE Access},
   title = {A Numerical Comparison of Iterative Algorithms for Inconsistency Reduction in Pairwise Comparisons},
   url = {https://ieeexplore.ieee.org/document/9408608},
   volume = {9},
   year = {2021}
}

TY  - JOUR
ID  - 55150
AU  - Mazurek, Jiří - Perzina, Radomír - Strzalka, Dominik - Kowal, Bartosz - Kuras, Pawel
PY  - 2021
TI  - A Numerical Comparison of Iterative Algorithms for Inconsistency Reduction in Pairwise Comparisons
JF  - IEEE Access
VL  - 9
IS  - není
SP  - 62553-62561
EP  - 62553-62561
SN  - 21693536
KW  - Algorithm
KW  - consistency
KW  - inconsistency reduction
KW  - pairwise comparisons
UR  - https://ieeexplore.ieee.org/document/9408608
N2  - 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 n = 4 and n = 8 with the initial inconsistency 0.10 <; CR <; 0.80 and entries drawn from Saaty's fundamental scale. Subsequently, we evaluate the algorithms' 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'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.
ER  -

MAZUREK, Jiří, Radomír PERZINA, Dominik STRZALKA, Bartosz KOWAL and Pawel KURAS. A Numerical Comparison of Iterative Algorithms for Inconsistency Reduction in Pairwise Comparisons. \textit{IEEE Access}. 2021, vol.~9, není, p.~62553-62561. ISSN~2169-3536. Available from: https://dx.doi.org/10.1109/ACCESS.2021.3074274.

Detailed Information on Publication Record