Improved Parameterized Algorithms for the Kemeny Aggregation Problem

DOI10.1007/978-3-642-11269-0_26zbMath1273.68186OpenAlexW2166642883MaRDI QIDQ3656872

Narges Simjour

Publication date: 14 January 2010

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11269-0_26

zbMATH Keywords

enumerationexact algorithmsparameterizedKemeny score

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Social choice (91B14)

Related Items

Studies in Computational Aspects of Voting ⋮ Space reduction constraints for the median of permutations problem ⋮ Towards a dichotomy for the possible winner problem in elections based on scoring rules ⋮ Automedian sets of permutations: direct sum and shuffle ⋮ Ranking and Drawing in Subexponential Time ⋮ Average parameterization and partial kernelization for computing medians ⋮ Partial Kernelization for Rank Aggregation: Theory and Experiments ⋮ Medians of Permutations: Building Constraints

Cites Work

• Unnamed Item
• Parameterized algorithms for feedback set problems and their duals in tournaments
• Voting schemes for which it can be difficult to tell who won the election
• A survey on the linear ordering problem for weighted or unweighted tournaments
• Fixed-Parameter Algorithms for Kemeny Scores
• Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
• Graph Drawing
• Aggregating inconsistent information