We propose new measures of consistency of additive and multiplicative pairwise comparison matrices. These measures, the relati6e consistency and relati6e error, are easy to compute and have clear and simple algebraic and geometric meaning, interpretation and properties. The correspondence between th
A method for approximating pairwise comparison matrices by consistent matrices
✍ Scribed by János Fülöp
- Publisher
- Springer US
- Year
- 2008
- Tongue
- English
- Weight
- 286 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0925-5001
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Consistency retrieval from a biased relative preference table is an imperative task in decision theory. This paper considers the least squares approximation of a pairwise comparison matrix by consistent matrices. It is observed that the highly nonlinear manifold of consistent matrices can be c
Pairwise comparison matrices (PCMs) over an Abelian linearly ordered (alo)-group G = (G, , ≤ ) have been introduced to generalize multiplicative, additive and fuzzy ones and remove some consistency drawbacks. Under the assumption of divisibility of G, for each PCM A = (a ij ), a -mean vector w m (A)
In a multicriteria decision making context, a pairwise comparison matrix A = (a ij ) is a helpful tool to determine the weighted ranking on a set X of alternatives or criteria. The entry a ij of the matrix can assume different meanings: a ij can be a preference ratio (multiplicative case) or a prefe