A polynomial algorithm for the 2-path problem for semicomplete digraphs
SIAM Journal on Discrete Mathematics
Rank aggregation methods for the Web
Proceedings of the 10th international conference on World Wide Web
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
SIAM Journal on Discrete Mathematics
A computational study of the Kemeny rule for preference aggregation
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
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
Feedback arc set in bipartite tournaments is NP-complete
Information Processing Letters
When are elections with few candidates hard to manipulate?
Journal of the ACM (JACM)
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A Short Introduction to Computational Social Choice
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
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
Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
Mathematics of Operations Research
Logic for automated mechanism design: a progress report
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - 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
Eliciting single-peaked preferences using comparison queries
Journal of Artificial Intelligence Research
Fixed-parameter tractability results for feedback set problems in tournaments
Journal of Discrete Algorithms
Note: A tournament of order 14 with disjoint Banks and Slater sets
Discrete Applied Mathematics
Ordering by weighted number of wins gives a good ranking for weighted tournaments
ACM Transactions on Algorithms (TALG)
Minimal retentive sets in tournaments
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Comparing multiagent systems research in combinatorial auctions and voting
Annals of Mathematics and Artificial Intelligence
Online ranking for tournament graphs
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Average parameterization and partial kernelization for computing medians
Journal of Computer and System Sciences
Linear programming based approximation algorithms for feedback set problems in bipartite tournaments
Theoretical Computer Science
Average parameterization and partial kernelization for computing medians
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
The complexity of computing minimal unidirectional covering sets
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Cloning in elections: finding the possible winners
Journal of Artificial Intelligence Research
On the approximability of Dodgson and Young elections
Artificial Intelligence
On the fixed-parameter tractability of composition-consistent tournament solutions
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Studies in computational aspects of voting: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
Computing a profit-maximizing sequence of offers to agents in a social network
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Quasi-hamiltonian paths in semicomplete multipartite digraphs
Discrete Applied Mathematics
It only takes a few: on the hardness of voting with a constant number of agents
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Kemeny elections with bounded single-peaked or single-crossing width
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alternatives (or candidates) to minimize the number of pairs of candidates such that the ranking disagrees with the pairwise majority vote on these two candidates. The use of the Slater rule has been hindered by a lack of techniques to compute Slater rankings. In this paper, we show how we can decompose the Slater problem into smaller subproblems if there is a set of similar candidates. We show that this technique suffices to compute a Slater ranking in linear time if the pairwise majority graph is hierarchically structured. For the general case, we also give an efficient algorithm for finding a set of similar candidates. We provide experimental results that show that this technique significantly (sometimes drastically) speeds up search algorithms, Finally, we also use the technique of similar sets to show that computing an optimal Slater ranking is NP-hard. even in the absence of pairwise ties.