Efficient Vectors for Block Perturbed Consistent Matrices
From MaRDI portal
Publication:6154953
Abstract: In prioritization schemes, based on pairwise comparisons, such as the Analytical Hierarchy Process, it is important to extract a cardinal ranking vector from a reciprocal matrix that is unlikely to be consistent. It is natural to choose such a vector only from efficient ones. Recently a method to generate inductively all efficient vectors for any reciprocal matrix has been discovered. Here we focus upon the study of efficient vectors for a reciprocal matrix that is a block perturbation of a consistent matrix in the sense that it is obtained from a consistent matrix by modifying entries only in a proper principal submatrix. We determine an explicit class of efficient vectors for such matrices. Based upon this, we give a description of all the efficient vectors in the 3-by-3 block perturbed case. In addition, we give sufficient conditions for the right Perron eigenvector of such matrices to be efficient and provide examples in which efficiency does not occur. Also, we consider a certain type of constant block perturbed consistent matrices, for which we may construct a class of efficient vectors, and demonstrate the efficiency of the Perron eigenvector. Appropriate examples are provided throughout.
Recommendations
- Efficient vectors for simple perturbed consistent matrices
- Efficient vectors for double perturbed consistent matrices
- Efficiency of the principal eigenvector of some triple perturbed consistent matrices
- Efficiency of the convex hull of the columns of certain triple perturbed consistent matrices
- Efficient vectors in priority setting methodology
Cites work
- scientific article; zbMATH DE number 3943488 (Why is no real title available?)
- A common framework for deriving preference values from pairwise comparison matrices
- A multicriteria evaluation of methods for obtaining weights from ratio- scale matrices
- A scaling method for priorities in hierarchical structures
- A simplified implementation of the least squares solution for pairwise comparisons matrices
- Deriving priorities from inconsistent PCM using network algorithms
- EFFECTIVENESS ANALYSIS OF DERIVING PRIORITY VECTORS FROM RECIPROCAL PAIRWISE COMPARISON MATRICES
- Efficiency analysis of simple perturbed pairwise comparison matrices
- Efficiency of any weighted geometric mean of the columns of a reciprocal matrix
- Efficiency of the principal eigenvector of some triple perturbed consistent matrices
- Efficient vectors for double perturbed consistent matrices
- Efficient vectors for simple perturbed consistent matrices
- Efficient weight vectors from pairwise comparison matrices
- How to derive priorities in AHP: a comparative study
- Inefficient weights from pairwise comparison matrices with arbitrarily small inconsistency
- Inferring efficient weights from pairwise comparison matrices
- Matrix Analysis
- On the extraction of weights from pairwise comparison matrices
- Solution of the least squares method problem of pairwise comparison matrices
- Vilfredo Pareto and multi-objective optimization
Cited in
(7)- Triple perturbed consistent matrix and the efficiency of its principal right eigenvector
- Positive vectors, pairwise comparison matrices and directed Hamiltonian cycles
- Efficient vectors in priority setting methodology
- Pairwise comparison matrices with uniformly ordered efficient vectors
- Efficient vectors for double perturbed consistent matrices
- Cycle products and efficient vectors in reciprocal matrices
- Efficiency of the convex hull of the columns of certain triple perturbed consistent matrices
This page was built for publication: Efficient Vectors for Block Perturbed Consistent Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154953)
