Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner
From MaRDI portal
Publication:2103031
DOI10.1016/J.EJOR.2022.07.031OpenAlexW4287448641MaRDI QIDQ2103031FDOQ2103031
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)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.07.031
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
combinatorial optimizationcomputational social choicegroup decisions and negotiationsranking aggregationKemeny method
Cites Work
- Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
- A new approach for identifying the Kemeny median ranking
- Experiments with Kemeny ranking: What works when?
- A new rank correlation coefficient with application to the consensus ranking problem
- Voting schemes for which it can be difficult to tell who won the election
- Computational Complexity
- Title not available (Why is that?)
- The complexity of Kemeny elections
- Title not available (Why is that?)
- Fixed-parameter algorithms for Kemeny rankings
- Independence of clones as a criterion for voting rules
- Handbook of Computational Social Choice
- A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method
- Median linear orders: Heuristics and a branch and bound algorithm
- Title not available (Why is that?)
- The number of weak orderings of a finite set
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)
