More complicated questions about maxima and minima, and some closures of NP
Theoretical Computer Science
SIAM Journal on Computing
Two remarks on the power of counting
Proceedings of the 6th GI-Conference on Theoretical Computer Science
The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Anyone but him: The complexity of precluding an alternative
Artificial Intelligence
Fixed-Parameter Algorithms for Kemeny Scores
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
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
Fixed-parameter algorithms for Kemeny rankings
Theoretical Computer Science
How hard is bribery in elections?
Journal of Artificial Intelligence Research
Preference functions that score rankings and maximum likelihood estimation
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On the role of distances in defining voting rules
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Using complexity to protect elections
Communications of the ACM
Fingerprinting ratings for collaborative filtering: theoretical and empirical analysis
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Average parameterization and partial kernelization for computing medians
Journal of Computer and System Sciences
Multimode control attacks on elections
Journal of Artificial Intelligence Research
Average parameterization and partial kernelization for computing medians
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Guarantees for the success frequency of an algorithm for finding dodgson-election winners
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Comparing and aggregating partial orders with kendall tau distances
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Hypercubewise preference aggregation in multi-issue domains
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
Complexity of judgment aggregation
Journal of Artificial Intelligence Research
Parameterized enumeration of (locally-) optimal aggregations
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Fully proportional representation as resource allocation: approximability results
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Multiwinner elections under preferences that are single-peaked on a tree
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 5.25 |
Kemeny proposed a voting scheme which is distinguished by the fact that it is the unique voting scheme that is neutral, consistent, and Condorcet. Bartholdi, Tovey, and Trick showed that determining the winner in Kemeny's system is NP-hard. We provide a stronger lower bound and an upper bound matching the lower bound, namely, we show that determining the winner in Kemeny's system is complete for P||NP, the class of sets solvable via parallel access to NP.