Efficient weight vectors from pairwise comparison matrices
arXiv:1602.03311 · doi:10.1016/j.ejor.2017.06.033
Abstract
Pairwise comparison matrices are frequently applied in multi-criteria decision making. A weight vector is called efficient if no other weight vector is at least as good in approximating the elements of the pairwise comparison matrix, and strictly better in at least one position. A weight vector is weakly efficient if the pairwise ratios cannot be improved in all non-diagonal positions. We show that the principal eigenvector is always weakly efficient, but numerical examples show that it can be inefficient. The linear programs proposed test whether a given weight vector is (weakly) efficient, and in case of (strong) inefficiency, an efficient (strongly) dominating weight vector is calculated. The proposed algorithms are implemented in Pairwise Comparison Matrix Calculator, available at pcmc.online.
19 pages
References in corpus (1)
Cited by in corpus (8)
- A characterization of the Logarithmic Least Squares Method
- On the monotonicity of the eigenvector method
- Efficiency analysis of double perturbed pairwise comparison matrices
- Revenue allocation in Formula One: a pairwise comparison approach
- Right-left asymmetry of the eigenvector method: A simulation study
- On the similarity between ranking vectors in the pairwise comparison method
- On the coincidence of optimal completions for small pairwise comparison matrices with missing entries
- The logarithmic least squares priorities and ordinal violations in the best-worst method