The complexity of Kemeny elections

Theoretical Computer Science

Volumn 349, Issue 3, 2005, Pages 382-391

  Hemaspaandra, Edith ^a   Spakowski, Holger ^b   Vogel, Jörg ^c  

^a Rochester Institute of Technology   (United States)

^b HEINRICH HEINE UNIVERSITY   (Germany)

^c FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Computational complexity; Election systems; Parallel access to NP

Indexed keywords

COMPUTER SCIENCE; SET THEORY; SYSTEMS ANALYSIS;

ELECTION SYSTEMS; PARALLEL ACCESS TO NP;

COMPUTATIONAL COMPLEXITY;

EID: 27844554412     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.08.031     Document Type: Article

References (19)

1. K. Arrow Social Choice and Individual Values 1951 Wiley New York (revised edition, 1963)
2. J. Bartholdi III, C. Tovey, and M. Trick Voting schemes for which it can be difficult to tell who won the election Social Choice Welfare 6 1989 157 165
3. M.J.A.N. de Caritat, Marquis de Condorcet, Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix. 1785, Facsimile reprint of original published in Paris, 1972, by the Imprimerie Royale, English translation appears in I. McLean and A. Urken, Classics of Social Choice, University of Michigan Press, 1995, pp. 91-112.
4. English translation appears in I. McLean and A. Urken, Classics of Social Choice, University of Michigan Press
5. T. Eiter, G. Gottlob, The complexity class Θ 2 p : recent results in AI and modal logic, in: Proc. of the 11th Conf. on Fundamentals of Computation Theory, Lecture Notes in Computer Science, vol. 1279, Springer, Berlin, 1997, pp. 1-18.
6. L. Hemachandra The strong exponential hierarchy collapses J. Comput. System Sci. 39 3 1989 299 322
7. E. Hemaspaandra, L. Hemaspaandra, and J. Rothe Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP J. ACM 44 6 1997 806 825
8. E. Hemaspaandra, J. Rothe, Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP, Technical Report Math/Inf/97/14, Institut für Informatik, Friedrich-Schiller- Universität, Jena, Germany, May 1997.
9. R. Karp Reducibilities among combinatorial problems R. Miller J. Thatcher Complexity of Computer Computations 1972 85 103
10. J. Kemeny Mathematics without numbers Daedalus 88 1959 571 591
11. R. Ladner, N. Lynch, and A. Selman A comparison of polynomial time reducibilities Theoret. Comput. Sci. 1 2 1975 103 124
12. A. Levenglick Fair and reasonable election systems Behavioral Sci. 20 1975 34 46
13. D. McGarvey A theorem on the construction of voting paradoxes Econometrica 21 1953 608 610
14. C. Papadimitriou, S. Zachos, Two remarks on the power of counting, in: Proc. of the Sixth GI Conf. Theoretical Computer Science, Lecture Notes in Computer Science, vol. 145, Springer, Berlin, 1983, pp. 269-276.
15. J. Rothe, H. Spakowski, and J. Vogel Exact complexity of the winner problem for Young elections Theory Comput. Systems 36 4 2003 375 386
16. H. Spakowski, J. Vogel, Θ 2 p -completeness: a classical approach for new results, in: Proc. of the 20th Conf. on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, vol. 1974, Springer, Berlin, December 2000, pp. 348-360.
17. K. Wagner More complicated questions about maxima and minima, and some closures of NP Theoret. Comput. Sci. 51 1-2 1987 53 80
18. K. Wagner Bounded query classes SIAM J. Comput. 19 5 1990 833 846
19. H. Young, and A. Levenglick A consistent extension of Condorcet's election principle SIAM J. Appl. Math. 35 1978 285 300