Information and preference in partial orders: A bimatrix representation (Q1090585)

From MaRDI portal
Revision as of 09:23, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Information and preference in partial orders: A bimatrix representation
scientific article

    Statements

    Information and preference in partial orders: A bimatrix representation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    The authors axiomatically characterize a distance on a set of orders which can have both indifference and incomparability extending the work of \textit{J. G. Kemeny} and \textit{J. L. Snell} (1962) and of \textit{K. P. Bogart} [Discrete Math. 5, 21-31 (1973; Zbl 0262.06001)]. This gives a consensus method by minimizing total distance.
    0 references
    0 references
    information and preference in partial orders
    0 references
    bimatrix representation
    0 references
    ordinal partial rankings
    0 references
    ranking
    0 references
    consensus method
    0 references
    0 references
    0 references