Incomplete pairwise comparison matrices and weighting methods

Abstract

A special class of preferences, given by a directed acyclic graph, is considered. They are represented by incomplete pairwise comparison matrices as only partial information is available: for some pairs no comparison is given in the graph. A weighting method satisfies the linear order preservation property if it always results in a ranking such that an alternative directly preferred to another does not have a lower rank. We study whether two procedures, the Eigenvector Method and the Logarithmic Least Squares Method meet this axiom. Both weighting methods break linear order preservation, moreover, the ranking according to the Eigenvector Method depends on the incomplete pairwise comparison representation chosen.

Cited by in corpus (9)

• A characterization of the Logarithmic Least Squares Method
• University rankings from the revealed preferences of the applicants
• Characterization of the row geometric mean ranking with a group consensus axiom
• An alternative quality of life ranking on the basis of remittances
• Revenue allocation in Formula One: a pairwise comparison approach
• How to choose a completion method for pairwise comparison matrices with missing entries: An axiomatic result
• The logarithmic least squares priorities and ordinal violations in the best-worst method
• Optimal sequences for pairwise comparisons: the graph of graphs approach
• Incomplete Analytic Hierarchy Process with Minimum Weighted Ordinal Violations