Deriving priorities from inconsistent PCM using network algorithms
From MaRDI portal
Publication:1730702
DOI10.1007/s10479-018-2888-xzbMath1410.90108arXiv1510.04315OpenAlexW3102525381WikidataQ129892752 ScholiaQ129892752MaRDI QIDQ1730702
Publication date: 6 March 2019
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.04315
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50) Deterministic network models in operations research (90B10)
Related Items (3)
Efficient Vectors for Block Perturbed Consistent Matrices ⋮ Efficient vectors for simple perturbed consistent matrices ⋮ Efficiency of the principal eigenvector of some triple perturbed consistent matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An intelligent decomposition of pairwise comparison matrices for large-scale decisions
- Boundary properties of the inconsistency of pairwise comparisons in group decisions
- Eigenvector ranking method as a measuring tool: formulas for errors
- An application of incomplete pairwise comparison matrices for ranking top tennis players
- Theoretical estimation of the probability of weight rank reversal in pairwise comparisons
- A simplified implementation of the least squares solution for pairwise comparisons matrices
- On optimal completion of incomplete pairwise comparison matrices
- 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 Saaty's and Koczkodaj's inconsistencies of pairwise comparison matrices
- Solution of the least squares method problem of pairwise comparison matrices
- A comparison of two methods for determining the weights of belonging to fuzzy sets
- Negative-cycle detection algorithms
- A new definition of consistency of pairwise comparisons
- A common framework for deriving preference values from pairwise comparison matrices
- Deriving weights from general pairwise comparison matrices
- An exact global optimization method for deriving weights from pairwise comparison matrices
- Convergence properties and practical estimation of the probability of rank reversal in pairwise comparisons for multi-criteria decision making problems
- Modeling assignment-based pairwise comparisons within integrated framework for value-driven multiple criteria sorting
- Contribution of individual judgments toward inconsistency in pairwise comparisons
- Inefficient weights from pairwise comparison matrices with arbitrarily small inconsistency
- A Different Perspective on a Scale for Pairwise Comparisons
- A modified regula falsi method for computing the root of an equation
- A new high order method of regula falsi type for computing a root of an equation
This page was built for publication: Deriving priorities from inconsistent PCM using network algorithms
