Average case complete problems
SIAM Journal on Computing
More complicated questions about maxima and minima, and some closures of NP
Theoretical Computer Science
The Boolean hierarchy I: structural properties
SIAM Journal on Computing
The polynomial time hierarchy collapses if the Boolean hierarchy collapses
SIAM Journal on Computing
Approximate solution of NP optimization problems
Theoretical Computer Science
A tight analysis of the greedy algorithm for set cover
Journal of Algorithms
Canonical Coin Changing and Greedy Solutions
Journal of the ACM (JACM)
A probabilistic analysis of a greedy algorithm arising from computational biology
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Introduction to Algorithms
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
Two remarks on the power of counting
Proceedings of the 6th GI-Conference on Theoretical Computer Science
A New Probabilistic Model for the Study of Algorithmic Properties of Random Graph Problems
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
The Probabilistic Analysis of a Greedy Satisfiability Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On finding the exact solution of a zero-one knapsack problem
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Journal of the ACM (JACM)
The complexity of Kemeny elections
Theoretical Computer Science
Parameterized Complexity
On the approximability of Dodgson and Young elections
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Note: Generalized juntas and NP-hard sets
Theoretical Computer Science
Llull and copeland voting broadly resist bribery and control
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
Dodgson's election system elegantly satisfies the Condorcet criterion. However, determining the winner of a Dodgson election is known to be ${\mathrm{\Theta}^{\mathit{p}}_2}$-complete ([1], see also [2]), which implies that unless P = NP no polynomial-time solution to this problem exists, and unless the polynomial hierarchy collapses to NP the problem is not even in NP. Nonetheless, we prove that when the number of voters is much greater than the number of candidates (although the number of voters may still be polynomial in the number of candidates), a simple greedy algorithm very frequently finds the Dodgson winners in such a way that it “knows” that it has found them, and furthermore the algorithm never incorrectly declares a nonwinner to be a winner.