Transitive Matrices, Strict Preference Order and Ordinal Evaluation Operators

2006 
Let X ={x 1, x 2, ..., x n } be a set of alternatives and a ij a positive number expressing how much the alternative x i is preferred to the alternative x j . Under suitable hypothesis of no indifference and transitivity over the pairwise comparison matrix A=(a ij ), the actual qualitative ranking on the set X is achievable. Then a coherent priority vector is a vector giving a weighted ranking agreeing with the actual ranking and an ordinal evaluation operator is a functional F that, acting on the row vectors $$\underline{a}_{i}$$, translates A in a coherent priority vector. In this paper we focus our attention on the matrix A, looking for conditions ensuring the existence of coherent priority vectors. Then, given a type of matrices, we look for ordinal evaluation operators, including OWA operators, associated to it.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    15
    References
    19
    Citations
    NaN
    KQI
    []