All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19520%2F21%3AA0000242" target="_blank" >RIV/47813059:19520/21:A0000242 - isvavai.cz</a>

  • Result on the web

    <a href="https://ieeexplore.ieee.org/document/9408608" target="_blank" >https://ieeexplore.ieee.org/document/9408608</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/ACCESS.2021.3074274" target="_blank" >10.1109/ACCESS.2021.3074274</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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 &lt;; CR &lt;; 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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2021

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    IEEE Access

  • ISSN

    2169-3536

  • e-ISSN

  • Volume of the periodical

    9

  • Issue of the periodical within the volume

    není

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    9

  • Pages from-to

    62553-62561

  • UT code for WoS article

    000645843700001

  • EID of the result in the Scopus database