Efficient weight vectors from pairwise comparison matrices
From MaRDI portal
Publication:1681485
DOI10.1016/j.ejor.2017.06.033zbMath1376.91043arXiv1602.03311OpenAlexW2255995813MaRDI QIDQ1681485
Publication date: 23 November 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.03311
Related Items (7)
Constrained consistency enforcement in AHP ⋮ Efficient vectors for double perturbed consistent matrices ⋮ Efficient Vectors for Block Perturbed Consistent Matrices ⋮ A characterization of the logarithmic least squares method ⋮ On the monotonicity of the eigenvector method ⋮ Efficient vectors for simple perturbed consistent matrices ⋮ Efficiency of the principal eigenvector of some triple perturbed consistent matrices
Cites Work
- Unnamed Item
- Investigation of the aggregation effectiveness of expert estimates obtained by the pairwise comparison method
- A parametric GP model dealing with incomplete information for group decision-making
- A revised framework for deriving preference values from pairwise comparison matrices
- Inferring efficient weights from pairwise comparison matrices
- A method for approximating pairwise comparison matrices by consistent matrices
- On the priority vector associated with a reciprocal relation and a pairwise comparison matrix
- Solution of the least squares method problem of pairwise comparison matrices
- A linear optimization problem to derive relative weights using an interval judgement matrix
- A note on the analysis of subjective judgement matrices
- A scaling method for priorities in hierarchical structures
- A comparison of two methods for determining the weights of belonging to fuzzy sets
- A multicriteria evaluation of methods for obtaining weights from ratio- scale matrices
- A common framework for deriving preference values from pairwise comparison matrices
- The mathematical equivalence of the ``spanning tree and row geometric mean preference vectors and its implications for preference analysis
- Corrigendum: ``Enumerating all spanning trees for pairwise comparisons [Comput. Oper. Res. 39 (2012) 191-199]
- Enumerating all spanning trees for pairwise comparisons
- Preference elicitation from inconsistent judgments using multi-objective optimization
- Vilfredo Pareto and multi-objective optimization
- Applications of soft computing. Recend trends.
- Inefficient weights from pairwise comparison matrices with arbitrarily small inconsistency
- Efficiency Analysis of Simple Perturbed Pairwise Comparison Matrices
- EFFECTIVENESS ANALYSIS OF DERIVING PRIORITY VECTORS FROM RECIPROCAL PAIRWISE COMPARISON MATRICES
- Priority Elicitation in the AHP by a Pareto Envelope-Based Selection Algorithm
- A distance-metric methodology for the derivation of weights from a pairwise comparison matrix
This page was built for publication: Efficient weight vectors from pairwise comparison matrices
