Efficiency of the principal eigenvector of some triple perturbed consistent matrices

DOI10.1016/J.EJOR.2021.08.012zbMath1490.91062OpenAlexW3194361536WikidataQ114184428 ScholiaQ114184428MaRDI QIDQ2076881

Rosário Fernandes, Susana Furtado

Publication date: 22 February 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.08.012

zbMATH Keywords

decision processespairwise comparison matrixconsistent matrixstrongly connected graphprincipal eigenvector efficiency

Mathematics Subject Classification ID

Decision theory (91B06) Management decision making, including multiple objectives (90B50) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)

Related Items (11)

Efficient vectors for double perturbed consistent matrices ⋮ Efficiency of any weighted geometric mean of the columns of a reciprocal matrix ⋮ Efficient Vectors for Block Perturbed Consistent Matrices ⋮ Efficient vectors in priority setting methodology ⋮ On the coincidence of optimal completions for small pairwise comparison matrices with missing entries ⋮ Cycle products and efficient vectors in reciprocal matrices ⋮ Some methods to derive the priority weights from the best-worst method matrix and weight efficiency test in view of incomplete pairwise comparison matrix ⋮ Triple perturbed consistent matrix and the efficiency of its principal right eigenvector ⋮ Pairwise comparison matrices with uniformly ordered efficient vectors ⋮ Positive vectors, pairwise comparison matrices and directed Hamiltonian cycles ⋮ Efficiency of the convex hull of the columns of certain triple perturbed consistent matrices

Uses Software

• AlphaGo

Cites Work

• Unnamed Item
• Unnamed Item
• Ranking by pairwise comparisons for Swiss-system tournaments
• Notes on order preservation and consistency in AHP
• An application of incomplete pairwise comparison matrices for ranking top tennis players
• Inferring efficient weights from pairwise comparison matrices
• A method for approximating pairwise comparison matrices by consistent matrices
• Solution of the least squares method problem of pairwise comparison matrices
• 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
• Inconsistency of special cases of pairwise comparisons matrices
• Jie Ke versus AlphaGo: a ranking approach using decision making method for large-scale data with incomplete information
• Efficient weight vectors from pairwise comparison matrices
• A characterization of the logarithmic least squares method
• Deriving priorities from inconsistent PCM using network algorithms
• When is the condition of order preservation met?
• Axiomatization of inconsistency indicators for pairwise comparisons
• Decision-making with the AHP: Why is the principal eigenvector necessary
• Transitive matrices and their applications
• On the monotonicity of the eigenvector method
• Reciprocal matrices: properties and approximation by a transitive matrix
• University rankings from the revealed preferences of the applicants
• On the ranking of a Swiss system chess team tournament
• Ramon Llull: from `Ars electionis' to social choice theory
• A critical analysis of the eigenvalue method used to derive priorities in AHP
• Inefficient weights from pairwise comparison matrices with arbitrarily small inconsistency
• Eigenvector Priority Function Causes Strong Rank Reversal in Group Decision Making
• Efficiency Analysis of Simple Perturbed Pairwise Comparison Matrices
• Matrix Analysis
• Comparison of eigenvalue, logarithmic least squares and least squares methods in estimating ratios
• Deriving weights from pairwise comparison matrices
• Eigenvector Method and Rank Reversal in Group Decision Making Revisited
• Consistency adjustments for pairwise comparison matrices

This page was built for publication: Efficiency of the principal eigenvector of some triple perturbed consistent matrices