Improved bounds for computing Kemeny rankings

Authors:
Vincent Conitzer;Andrew Davenport;Jayant Kalagnanam
Affiliations:
Computer Science Department, Carnegie Mellon University, Pittsburgh, PA;Mathematical Sciences Department, IBM T.J. Watson Research Center, Yorktown Heights, New York;Mathematical Sciences Department, IBM T.J. Watson Research Center, Yorktown Heights, New York
Venue:
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Year:
2006

Citing 13
Cited 24

Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP

Journal of the ACM (JACM)
Rank aggregation methods for the Web

Proceedings of the 10th international conference on World Wide Web
Social Choice Theory and Recommender Systems: Analysis of the Axiomatic Foundations of Collaborative Filtering

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Vote elicitation: complexity and strategy-proofness

Eighteenth national conference on Artificial intelligence
Aggregating inconsistent information: ranking and clustering

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Ranking systems: the PageRank axioms

Proceedings of the 6th ACM conference on Electronic commerce
Ordering by weighted number of wins gives a good ranking for weighted tournaments

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A computational study of the Kemeny rule for preference aggregation

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Learning to order things

Journal of Artificial Intelligence Research
Universal voting protocol tweaks to make manipulation hard

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
On the axiomatic foundations of ranking systems

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Small coalitions cannot manipulate voting

FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
Hybrid voting protocols and hardness of manipulation

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

When are elections with few candidates hard to manipulate?

Journal of the ACM (JACM)
A Short Introduction to Computational Social Choice

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Fixed-Parameter Algorithms for Kemeny Scores

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
On the approximability of Dodgson and Young elections

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
How similarity helps to efficiently compute Kemeny rankings

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Computational aspects of covering in dominance graphs

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
A computational analysis of the tournament equilibrium set

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Fixed-parameter algorithms for Kemeny rankings

Theoretical Computer Science
Preference functions that score rankings and maximum likelihood estimation

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Making decisions based on the preferences of multiple agents

Communications of the ACM
The unavailable candidate model: a decision-theoretic view of social choice

Proceedings of the 11th ACM conference on Electronic commerce
Using complexity to protect elections

Communications of the ACM
Comparing multiagent systems research in combinatorial auctions and voting

Annals of Mathematics and Artificial Intelligence
Ranking from pairs and triplets: information quality, evaluation methods and query complexity

Proceedings of the fourth ACM international conference on Web search and data mining
Average parameterization and partial kernelization for computing medians

Journal of Computer and System Sciences
Computational social choice: the first four centuries

XRDS: Crossroads, The ACM Magazine for Students - Computer Science in Service of Democracy
Average parameterization and partial kernelization for computing medians

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
So who won?: dynamic max discovery with the crowd

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
On the approximability of Dodgson and Young elections

Artificial Intelligence
A Major League Baseball Team Uses Operations Research to Improve Draft Preparation

Interfaces
Complexity of judgment aggregation

Journal of Artificial Intelligence Research
Designing social choice mechanisms using machine learning

Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Parameterized enumeration of (locally-) optimal aggregations

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Kemeny elections with bounded single-peaked or single-crossing width

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.03

Visualization

Abstract

Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the number of cases where the final ranking disagrees with a vote on the order of two alternatives. Unfortunately, Kemeny rankings are NP-hard to compute. Recent work on computing Kemeny rankings has focused on producing good bounds to use in search-based methods. In this paper, we extend on this work by providing various improved bounding techniques. Some of these are based on cycles in the pairwise majority graph, others are based on linear programs. We completely characterize the relative strength of all of these bounds and provide some experimental results.