Szczegóły publikacji
Opis bibliograficzny
Inconsistency in the ordinal pairwise comparisons method with and without ties : decision support / Konrad KUŁAKOWSKI // European Journal of Operational Research ; ISSN 0377-2217. — 2018 — vol. 270 iss. 1, s. 314–327. — Bibliogr. s. 326–327, Abstr. — Publikacja dostępna online od: 2018-03-27
Autor
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 114716 |
|---|---|
| Data dodania do BaDAP | 2018-07-03 |
| Tekst źródłowy | URL |
| DOI | 10.1016/j.ejor.2018.03.024 |
| Rok publikacji | 2018 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | European Journal of Operational Research |
Abstract
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.
