Deriving weights from pairwise comparison ratio matrices: An axiomatic approach (Q1107400)

From MaRDI portal
Revision as of 03:11, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Deriving weights from pairwise comparison ratio matrices: An axiomatic approach
scientific article

    Statements

    Deriving weights from pairwise comparison ratio matrices: An axiomatic approach (English)
    0 references
    0 references
    0 references
    1988
    0 references
    This paper examines the problem of extracting object or attribute weights from a pairwise comparision ratio matrix. This problem is approached from the point of view of a distance measure on the space of all such matrices. A set of axioms is presented which such a distance measure should satisfy, and the uniqueness of the measure is proven. The problem of weight derivation is then shown to be equivalent to that of finding a totally transitive matrix which is a minimum distance from the given matrix. This problem reduces to a goal programming model. Finally, it is shown that the problem of weight derivation is related to that of ranking players in a round robin tournament. The space of all binary tournament matrices is proven to be isometric to a subset of the space of ratio matrices.
    0 references
    0 references
    pairwise comparision ratio matrix
    0 references
    set of axioms
    0 references
    distance measure
    0 references
    weight derivation
    0 references
    goal programming
    0 references
    round robin tournament
    0 references