Incomplete Analytic Hierarchy Process with Minimum Weighted Ordinal Violations

Abstract

Incomplete pairwise comparison matrices offer a natural way of expressing preferences in decision making processes. Although ordinal information is crucial, there is a bias in the literature: cardinal models dominate. Ordinal models usually yield non-unique solutions; therefore, an approach blending ordinal and cardinal information is needed. In this work, we consider two cascading problems: first, we compute ordinal preferences, maximizing an index that combines ordinal and cardinal information; then, we obtain a cardinal ranking by enforcing ordinal constraints. Notably, we provide a sufficient condition (that is likely to be satisfied in practical cases) for the first problem to admit a unique solution and we develop a provably polynomial-time algorithm to compute it. The effectiveness of the proposed method is analyzed and compared with respect to other approaches and criteria at the state of the art.

arXiv commentpreprint submitted to the International Journal of General Systems

References in corpus (5)

• An application of incomplete pairwise comparison matrices for ranking top tennis players
• Ranking by pairwise comparisons for Swiss-system tournaments
• 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
• On the geometric mean method for incomplete pairwise comparisons
• Incomplete pairwise comparison matrices and weighting methods