Robustness of priority deriving methods for pairwise comparison matrices against rank reversal: a probabilistic approach
From MaRDI portal
Publication:6491674
DOI10.1007/S10479-023-05753-0MaRDI QIDQ6491674
Jaroslav Ramík, David Bartl, Jan Górecki
Publication date: 24 April 2024
Published in: Annals of Operations Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- On optimal completion of incomplete pairwise comparison matrices
- How to derive priorities in AHP: a comparative study
- Eigenvector and logarithmic least squares
- On Saaty's and Koczkodaj's inconsistencies of pairwise comparison matrices
- A note on the analysis of subjective judgement matrices
- Uncertainty and rank order in the analytic hierarchy process
- A scaling method for priorities in hierarchical structures
- On a proposal of Jensen for the analysis of ordinal pairwise preferences using Saaty's eigenvector scaling method
- A common framework for deriving preference values from pairwise comparison matrices
- On the monotonicity of the eigenvector method
- Robustness to rank reversal in pairwise comparison matrices based on uncertainty bounds
- Coherent weights for pairwise comparison matrices and a mixed-integer linear programming problem
- Pairwise comparisons method. Theory and applications in decision making
- On the ranking of a Swiss system chess team tournament
- Weighted distances between preferences
- Eigenvector Priority Function Causes Strong Rank Reversal in Group Decision Making
- A general unified framework for pairwise comparison matrices in multicriterial methods
- Rank According to Perron: A New Insight
- Eigenvector Method and Rank Reversal in Group Decision Making Revisited
- Elements of Information Theory
- A new algorithm for computing priority vector of pairwise comparisons matrix with fuzzy elements
This page was built for publication: Robustness of priority deriving methods for pairwise comparison matrices against rank reversal: a probabilistic approach
