Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner (Q2103031)

From MaRDI portal
Revision as of 20:20, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner
scientific article

    Statements

    Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner (English)
    0 references
    0 references
    0 references
    0 references
    12 December 2022
    0 references
    0 references
    group decisions and negotiations
    0 references
    combinatorial optimization
    0 references
    computational social choice
    0 references
    ranking aggregation
    0 references
    Kemeny method
    0 references
    0 references