The logarithmic least squares priorities and ordinal violations in the best-worst method
arXiv:2304.12626 · doi:10.1016/j.eswa.2024.125966
Abstract
The best-worst method is an increasingly popular approach to solving multi-criteria decision-making problems. However, the usual prioritisation techniques may result in an ordinal violation if the best (worst) alternative identified in the first step does not receive the highest (lowest) weight. The current paper gives two sufficient conditions for the logarithmic least squares method, applied to an incomplete best-worst method matrix, to guarantee the lack of ordinal violations. Our results provide another powerful argument for using the logarithmic least squares priorities in the best-worst method.
arXiv comment14 pages, 1 figure
References in corpus (11)
- 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
- A characterization of the Logarithmic Least Squares Method
- Efficient weight vectors from pairwise comparison matrices
- Inconsistency indices for incomplete pairwise comparisons matrices
- Characterization of the row geometric mean ranking with a group consensus axiom
- Efficiency analysis of double perturbed pairwise comparison matrices
- A graph interpretation of the least squares ranking method
- Incomplete pairwise comparison matrices and weighting methods
- Efficiency analysis of simple perturbed pairwise comparison matrices
- A lexicographically optimal completion for pairwise comparison matrices with missing entries
- How to choose a completion method for pairwise comparison matrices with missing entries: An axiomatic result