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

DOI10.1016/J.EJOR.2022.07.031MaRDI QIDQ2103031zbMATH OpenOpenAlexFDO

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

Publication date 12 December 2022

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

combinatorial optimizationcomputational social choicegroup decisions and negotiationsranking aggregationKemeny method

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• A note on the query complexity of the Condorcet winner problem
• Efficient algorithms using subiterative convergence for Kemeny ranking problem
• Fixed-parameter algorithms for Kemeny rankings
• Competitive analysis of the top-\(K\) ranking problem
• Beyond the worst case: semi-random complexity analysis of winner determination
• Ranking and drawing in subexponential time
• Tournament Ranking with Expected Profit in Polynomial Time
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament
• Sharp bounds for winning probabilities in the competitive rank selection problem

Cites work

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

This page was built for publication: Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103031)