The incomplete Analytic Hierarchy Process and Bradley-Terry model: (in)consistency and information retrieval
arXiv:2210.03700 · doi:10.1016/j.eswa.2023.120522
Abstract
Several methods of preference modeling, ranking, voting and multi-criteria decision making include pairwise comparisons. It is usually simpler to compare two objects at a time, furthermore, some relations (e.g., the outcome of sports matches) are naturally known for pairs. This paper investigates and compares pairwise comparison models and the stochastic Bradley-Terry model. It is proved that they provide the same priority vectors for consistent (complete or incomplete) comparisons. For incomplete comparisons, all filling in levels are considered. Recent results identified the optimal subsets and sequences of multiplicative/additive/reciprocal pairwise comparisons for small sizes of items (up to n = 6). Simulations of this paper show that the same subsets and sequences are optimal in case of the Bradley-Terry and the Thurstone models as well. This, somehow surprising, coincidence suggests the existence of a more general result. Further models of information and preference theory are subject to future investigation in order to identify optimal subsets of input data.
References in corpus (5)
- An application of incomplete pairwise comparison matrices for ranking top tennis players
- The (logarithmic) least squares optimality of the arithmetic (geometric) mean of weight vectors calculated from all spanning trees for incomplete additive (multiplicative) pairwise comparison matrices
- Inconsistency indices for incomplete pairwise comparisons matrices
- Filling in pattern designs for incomplete pairwise comparison matrices: (quasi-)regular graphs with minimal diameter
- On the Derivation of Weights from Incomplete Pairwise Comparisons Matrices via Spanning Trees with Crisp and Fuzzy Confidence Levels