Incomplete pairwise comparison matrices and weighting methods

DOI10.3233/FI-2016-1337MaRDI QIDQ2968841zbMATH OpenFDO

Authors László Csató, Lajos Rónyai

Publication date 22 March 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1507.00461

zbMATH Keywords

directed acyclic grapheigenvector methodincomplete pairwise comparison matrixlogarithmic least squares method

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Decision theory (91B06) Individual preferences (91B08)

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.

Recommendations

• On optimal completion of incomplete pairwise comparison matrices
• Incomplete pairwise comparison matrices based on graphs with average degree approximately 3
• Preservation of preferences intensity of an inconsistent pairwise comparison matrix
• Analytical incomplete multiplicative pairwise comparisons method
• Representing the strengths and directions of pairwise comparisons

Cited in

(17)

• A characterization of the logarithmic least squares method
• A DEMATEL-based completion method for incomplete pairwise comparison matrix in AHP
• On the derivation of weights from incomplete pairwise comparisons matrices via spanning trees with crisp and fuzzy confidence levels
• Preservation of preferences intensity of an inconsistent pairwise comparison matrix
• Inefficient weights from pairwise comparison matrices with arbitrarily small inconsistency
• An application of incomplete pairwise comparison matrices for ranking top tennis players
• Some weight-preserving properties for prioritization methods in judgement matrix
• A heuristic method to rectify intransitive judgments in pairwise comparison matrices
• scientific article; zbMATH DE number 847160 (Why is no real title available?)
• Advances in Intelligent Data Analysis VI
• On optimal completion of incomplete pairwise comparison matrices
• Incomplete pairwise comparison matrices based on graphs with average degree approximately 3
• How to choose a completion method for pairwise comparison matrices with missing entries: an axiomatic result
• Almost optimal manipulation of pairwise comparisons of alternatives
• Optimal sequences for pairwise comparisons: the graph of graphs approach
• Representing the strengths and directions of pairwise comparisons
• Deriving weights from pairwise comparison matrices: The additive case

This page was built for publication: Incomplete pairwise comparison matrices and weighting methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2968841)