More complicated questions about maxima and minima, and some closures of NP
Theoretical Computer Science
SIAM Journal on Computing
Kolmogorov characterizations of complexity classes
Theoretical Computer Science
Introduction to the theory of complexity
Introduction to the theory of complexity
Computing functions with parallel queries to NP
Theoretical Computer Science
Raising NP lower bounds to parallel NP lower bounds
ACM SIGACT News
On the complexity of unique solutions
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Two remarks on the power of counting
Proceedings of the 6th GI-Conference on Theoretical Computer Science
The Minimization Problem for Boolean Formulas
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Computational Politics: Electoral Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Theta2p-Completeness: A Classical Approach for New Results
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Unconditional privacy in social choice
TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
The complexity of chromatic strength and chromatic edge strength
Computational Complexity
The complexity of Kemeny elections
Theoretical Computer Science
Journal of Computer and System Sciences
When are elections with few candidates hard to manipulate?
Journal of the ACM (JACM)
Anyone but him: The complexity of precluding an alternative
Artificial Intelligence
A Short Introduction to Computational Social Choice
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Parameterized Computational Complexity of Dodgson and Young Elections
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
On the approximability of Dodgson and Young elections
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Frequency of correctness versus average polynomial time
Information Processing Letters
Computing slater rankings using similarities among candidates
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Improved bounds for computing Kemeny rankings
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Nonexistence of voting rules that are usually hard to manipulate
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
The complexity of bribery in elections
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Anyone but him: the complexity of precluding an alternative
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Determining possible and necessary winners under common voting rules given partial orders
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Eliciting single-peaked preferences using comparison queries
Journal of Artificial Intelligence Research
How hard is bribery in elections?
Journal of Artificial Intelligence Research
The Computational Complexity of Weak Saddles
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Socially desirable approximations for Dodgson's voting rule
Proceedings of the 11th ACM conference on Electronic commerce
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
Comparing multiagent systems research in combinatorial auctions and voting
Annals of Mathematics and Artificial Intelligence
Approximation algorithms for campaign management
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Multimode control attacks on elections
Journal of Artificial Intelligence Research
The nearest neighbor spearman footrule distance for bucket, interval, and partial orders
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Deciding according to the shortest computations
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Determining possible and necessary winners under common voting rules given partial orders
Journal of Artificial Intelligence Research
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
Some representation and computational issues in social choice
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
The complexity of semilinear problems in succinct representation
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
The complexity of computing minimal unidirectional covering sets
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
On the approximability of Dodgson and Young elections
Artificial Intelligence
Optimal social choice functions: a utilitarian view
Proceedings of the 13th ACM Conference on Electronic Commerce
Studies in computational aspects of voting: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Complexity of judgment aggregation
Journal of Artificial Intelligence Research
On elections with robust winners
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
Journal of Combinatorial Optimization
Multiwinner elections under preferences that are single-peaked on a tree
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Socially desirable approximations for dodgson’s voting rule
ACM Transactions on Algorithms (TALG)
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.02 |
In 1876, Lewis Carroll proposed a voting system in which the winner is the candidate who with the fewest changes in voters' preferences becomes a Condorcet winner—a candidate who beats all other candidates in pairwise majority-rule elections. Bartholdi, Tovey, and Trick provided a lower bound—NP-hardness—on the computational complexity of determining the election winner in Carroll's system. We provide a stronger lower bound and an upper bound that matches our lower bound. In particular, determining the winner in Carroll's system is complete for parallel access to NP, that is, it is complete for Theta_2p for which it becomes the most natural complete problem known. It follows that determining the winner in Carroll's elections is not NP-complete unless the polynomial hierarchy collapses.