Efficiency analysis of simple perturbed pairwise comparison matrices

DOI10.3233/FI-2016-1335MaRDI QIDQ2968837zbMATH OpenOpenAlexFDO

Authors Kristóf Ábele-Nagy, Sándor Bozóki

Publication date 22 March 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1505.06849

zbMATH Keywords

efficiencyeigenvectorpairwise comparison matrixPareto optimality

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Decision theory (91B06)

Abstract: Efficiency, the basic concept of multi-objective optimization is investigated for the class of pairwise comparison matrices. A weight vector is called efficient if no alternative weight vector exists such that every pairwise ratio of the latter's components is at least as close to the corresponding element of the pairwise comparison matrix as the one of the former's components is, and the latter's approximation is strictly better in at least one position. A pairwise comparison matrix is called simple perturbed if it differs from a consistent pairwise comparison matrix in one element and its reciprocal. One of the classical weighting methods, the eigenvector method is analyzed. It is shown in the paper that the principal right eigenvector of a simple perturbed pairwise comparison matrix is efficient.

Recommendations

• Efficient weight vectors from pairwise comparison matrices
• Efficiency of the principal eigenvector of some triple perturbed consistent matrices
• Efficient vectors for simple perturbed consistent matrices
• Inferring efficient weights from pairwise comparison matrices
• Inefficient weights from pairwise comparison matrices with arbitrarily small inconsistency

Cited in

(19)

• Efficient weight vectors from pairwise comparison matrices
• 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
• INVERSE SENSITIVE ANALYSIS OF PAIRWISE COMPARISON MATRICES
• Efficacy analysis of ratios from pairwise comparisons
• 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
• 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
• Efficient vectors in priority setting methodology
• Positive vectors, pairwise comparison matrices and directed Hamiltonian cycles
• Cycle products and efficient vectors in reciprocal matrices
• Efficiency of the convex hull of the columns of certain triple perturbed consistent matrices
• Efficiency analysis of natural cardinal ranking vectors for pairwise comparisons and the universal efficiency of the Perron geometric mean
• Efficiency analysis for the Perron vector of a reciprocal matrix
• The complete set of efficient vectors for a pairwise comparison matrix

This page was built for publication: Efficiency analysis of simple perturbed pairwise comparison matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2968837)