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

DOI10.1016/j.ejor.2022.07.031OpenAlexW4287448641MaRDI QIDQ2103031

Irene Díaz, Noelia Rico, Camino R. Vela

Publication date: 12 December 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.07.031

zbMATH Keywords

combinatorial optimizationgroup decisions and negotiationscomputational social choiceranking aggregationKemeny method

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
• Experiments with Kemeny ranking: What works when?
• Independence of clones as a criterion for voting rules
• Median linear orders: Heuristics and a branch and bound algorithm
• A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method
• The complexity of Kemeny elections
• Fixed-parameter algorithms for Kemeny rankings
• Voting schemes for which it can be difficult to tell who won the election
• A new approach for identifying the Kemeny median ranking
• The number of weak orderings of a finite set
• A new rank correlation coefficient with application to the consensus ranking problem
• Handbook of Computational Social Choice
• Computational Complexity