Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner
type: Item
instance of: scholarly article
title: Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner
author: Noelia Rico
author: Camino R. Vela
author: Irene Díaz
published in: European Journal of Operational Research
publication date: 2022-12-12T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7632170
zbMATH Keywords: group decisions and negotiations
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: computational social choice
zbMATH Keywords: ranking aggregation
zbMATH Keywords: Kemeny method
MaRDI profile type: Publication
full work available at URL: j.ejor.2022.07.031
OpenAlex ID: W4287448641
cites work: Experiments with Kemeny ranking: What works when?
cites work: Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
cites work: Computational Complexity
cites work: Q3738839
cites work: A new approach for identifying the Kemeny median ranking
cites work: The number of weak orderings of a finite set
cites work: Median linear orders: Heuristics and a branch and bound algorithm
cites work: Voting schemes for which it can be difficult to tell who won the election
cites work: Fixed-parameter algorithms for Kemeny rankings
cites work: Handbook of Computational Social Choice
cites work: A new rank correlation coefficient with application to the consensus ranking problem
cites work: Q5668657
cites work: The complexity of Kemeny elections
cites work: Q5320763
cites work: A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method
cites work: Independence of clones as a criterion for voting rules
DOI: 10.1016/J.EJOR.2022.07.031
Recommended article: A note on the query complexity of the Condorcet winner problem
Recommended article: Efficient algorithms using subiterative convergence for Kemeny ranking problem
Recommended article: Fixed-parameter algorithms for Kemeny rankings
Recommended article: Competitive analysis of the top-K ranking problem
Recommended article: Beyond the worst case: semi-random complexity analysis of winner determination
Recommended article: Ranking and Drawing in Subexponential Time
Recommended article: Tournament Ranking with Expected Profit in Polynomial Time
Recommended article: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Recommended article: Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament
Recommended article: Sharp bounds for winning probabilities in the competitive rank selection problem
description: scientific article; zbMATH DE number 7632170