Inconsistency in the ordinal pairwise comparisons method with and without ties

被引:32
|
作者
Kulakowski, Konrad [1 ]
机构
[1] AGH Univ Sci & Technol, Krakow, Poland
关键词
Decision support systems; Pairwise comparisons; Inconsistency; AHP; Set cover problem; COMPARISON MATRICES; CONSISTENCY INDEX; AHP;
D O I
10.1016/j.ejor.2018.03.024
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Comparing alternatives in pairs is a well-known method used to create ranking. Experts are asked to perform a series of binary comparisons and then, using mathematical methods, the final ranking is constructed. Experts conduct a series of single assessments, however, they may not always be consistent. The level of inconsistency among individual assessments is widely accepted as a measure of the ranking quality. The higher the ranking quality, the higher its credibility. One of the earliest and most widespread inconsistency indices is the consistency coefficient defined by Kendall and Babington Smith. In their work, the authors consider binary pairwise comparisons, i.e., those where the result of an individual comparison can only be better or worse. In the presented work, the maximal number of inconsistent triads in the set of ordinal pairwise comparisons with ties of arbitrary size is determined (formula 14). This, in turn, opens the possibility of effectively extending the Kendall and Babington Smith index to pairwise comparisons, where the result of an individual comparison can be: better, worse or equal. Hence, this effectively extends the use of this index to the Analytic Hierarchy Process and other quantitative methods based on comparing alternatives in pairs. The work also introduces the notions of a generalized tournament and a double tournament as graphs that model ordinal pairwise comparisons with ties and the maximally inconsistent set of pair wise comparisons with ties, respectively. The relationship between the most inconsistent set of pairwise comparisons with ties and the set cover problem is also shown. (C)2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:314 / 327
页数:14
相关论文
共 50 条
  • [1] A gradient method for inconsistency reduction of pairwise comparisons matrices
    Magnot, Jean-Pierre
    Mazurek, Jiri
    Cernanova, Viera
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2023, 152 : 46 - 58
  • [2] A Concurrent Inconsistency Reduction Algorithm for the Pairwise Comparisons Method
    Kulakowski, Konrad
    Juszczyk, Radoslaw
    Ernst, Sebastian
    ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, PT II (ICAISC 2015), 2015, 9120 : 214 - 222
  • [3] THE LIMIT OF INCONSISTENCY REDUCTION IN PAIRWISE COMPARISONS
    Koczkodaj, Waldemar W.
    Szybowski, Jacek
    INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE, 2016, 26 (03) : 721 - 729
  • [4] On Axiomatization of Inconsistency Indicators for Pairwise Comparisons
    Koczkodaj, Waldemar W.
    Szwarc, Ryszard
    FUNDAMENTA INFORMATICAE, 2014, 132 (04) : 485 - 500
  • [5] On normalization of inconsistency indicators in pairwise comparisons
    Koczkodaj, W.W. (wkoczkodaj@cs.laurentian.ca), 1600, Elsevier Inc. (86):
  • [6] Convergence of inconsistency algorithms for the pairwise comparisons
    Holsztynski, W
    Koczkodaj, WW
    INFORMATION PROCESSING LETTERS, 1996, 59 (04) : 197 - 202
  • [7] A survey of inconsistency indices for pairwise comparisons
    Brunelli, Matteo
    INTERNATIONAL JOURNAL OF GENERAL SYSTEMS, 2018, 47 (08) : 751 - 771
  • [8] On normalization of inconsistency indicators in pairwise comparisons
    Koczkodaj, W. W.
    Magnot, J. -P.
    Mazurek, J.
    Peters, J. F.
    Rakhshani, H.
    Soltys, M.
    Strzalka, D.
    Szybowski, J.
    Tozzi, A.
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2017, 86 : 73 - 79
  • [9] Axiomatization of inconsistency indicators for pairwise comparisons
    Koczkodaj, W. W.
    Urban, R.
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2018, 94 : 18 - 29
  • [10] Axiomatic properties of inconsistency indices for pairwise comparisons
    Brunelli, Matteo
    Fedrizzi, Michele
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2015, 66 (01) : 1 - 15