Computing a consistent approximation to a generalized pairwise comparisons matrix (Q1962971)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1391512
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing a consistent approximation to a generalized pairwise comparisons matrix |
scientific article; zbMATH DE number 1391512 |
Statements
Computing a consistent approximation to a generalized pairwise comparisons matrix (English)
0 references
20 January 2000
0 references
The authors introduce an algorithm of complexity \(O(n^2)\) for computing a consistent approximation to a generalized pairwise comparisons matrix. The algorithm is based on a logarithmic transformation of the matrix into a linear space with the Euclidean metric. It uses both the row and (reciprocals of) column geometric means. The resulting approximation is optimal and consistent.
0 references
inconsistency
0 references
algorithm
0 references
complexity
0 references
pairwise comparisons matrix
0 references
logarithmic transformation
0 references
0 references
0.8615420460700989
0 references
0.7572310566902161
0 references
0.7527856230735779
0 references
0.7509570121765137
0 references
0.7497450113296509
0 references
