Inconsistency thresholds for incomplete pairwise comparison matrices
arXiv:2102.10558 · doi:10.1016/j.omega.2021.102576
Abstract
Pairwise comparison matrices are increasingly used in settings where some pairs are missing. However, there exist few inconsistency indices for similar incomplete data sets and no reasonable measure has an associated threshold. This paper generalises the famous rule of thumb for the acceptable level of inconsistency, proposed by Saaty, to incomplete pairwise comparison matrices. The extension is based on choosing the missing elements such that the maximal eigenvalue of the incomplete matrix is minimised. Consequently, the well-established values of the random index cannot be adopted: the inconsistency of random matrices is found to be the function of matrix size and the number of missing elements, with a nearly linear dependence in the case of the latter variable. Our results can be directly built into decision-making software and used by practitioners as a statistical criterion for accepting or rejecting an incomplete pairwise comparison matrix.
arXiv comment16 pages, 3 figures, 4 tables
References in corpus (11)
- An application of incomplete pairwise comparison matrices for ranking top tennis players
- Ranking by pairwise comparisons for Swiss-system tournaments
- On the ranking of a Swiss system chess team tournament
- On reducing inconsistency of pairwise comparison matrices below an acceptance threshold
- An LP-based inconsistency monitoring of pairwise comparison matrices
- University rankings from the revealed preferences of the applicants
- Inconsistency indices for incomplete pairwise comparisons matrices
- On the monotonicity of the eigenvector method
- Filling in pattern designs for incomplete pairwise comparison matrices: (quasi-)regular graphs with minimal diameter
- An alternative quality of life ranking on the basis of remittances
- Revenue allocation in Formula One: a pairwise comparison approach