Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP

Journal of the ACM

Volumn 44, Issue 6, 1997, Pages 806-825

  Hemaspaandra, Edith ^a   Hemaspaandra, Lane A ^b,d   Rothe, Jörg ^c  

^a LE MOYNE COLLEGE   (United States)

^b UNIVERSITY OF ROCHESTER   (United States)

^c FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^d University of Rochester   (United States)

Author keywords

Completeness; Election systems; Lewis Carroll; Majority rule; Theory

Indexed keywords

COMPUTATIONAL COMPLEXITY; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS; PROBLEM SOLVING;

VOTING SYSTEMS;

VOTING MACHINES;

EID: 0031269788     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/268999.269002     Document Type: Article

References (26)

1. BARTHOLDI III, J., TOVEY, C., AND TRICK, M. 1989. Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare 6, 157-165.
2. BLACK, D. 1958. Theory of Committees and Elections. Cambridge University Press, Cambridge, Mass.
3. BOVET, D., AND CRESCENZI, P. 1993. Introduction to the Theory of Complexity. Prentice-Hall, Englewood Cliffs, N.J.
4. CONDORCET, M. 1785. Essai sur l'Application de L'Analyse àla Probabilité des Décisions Rendues à la Pluraliste des Voix. Facsimile reprint of original published in Paris, 1972, by the Imprimerie Royale.
5. DODGSON, C. 1876. A method of taking votes on more than two issues. Pamphlet printed by the Clarendon Press, Oxford, and headed "not yet published" (see the discussions in McLean and Urken [1995] and Black [1958], both of which reprint this paper).
6. GAREY, M., AND JOHNSON, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company.
7. HEMACHANDRA, L. 1989. The strong exponential hierarchy collapses. J. Comput. Syst. Sci. 39, 3, 299-322.
8. HEMACHANDRA, L., AND WECHSUNG, G. 1991. Kolmogorov characterizations of complexity classes. Theoret. Comput. Sci. 83, 313-322.
9. HEMASPAANDRA, E., HEMASPAANDRA, L., AND ROTHE, J. 1997. Raising NP lower bounds to parallel NP lower bounds. SIGACT News 28, 2, 2-13.
10. HEMASPAANDRA, E., AND ROTHE, J. 1997. Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP. Tech. Rep. Math/Inf/97/14 (May). Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany.
11. HEMASPAANDRA, E., AND WECHSUNG, G. 1997. The minimization problem for boolean formulas. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press. New York, pp. 575-584.
12. JENNER, B., AND TORÁN, J. 1995. Computing functions with parallel queries to NP. Theoret. Comput. Sci. 141, 1-2, 175-193. Corrigendum available at http://www,informatik.uni-ulm.de/abt/ti/ Personen/jtpapers.html.
13. NP[log n] and sparse Turing-complete sets for NP. J. Comput. Syst. Sci. 39, 3, 282-298.
14. KÖBLER, J., SCHÖNING, U., AND WAGNER, K. 1987. The difference and truth-table hierarchies for NP. RAIRO Theoret. Inf. Appl. 21, 419-435.
15. LADNER, R., LYNCH, N., AND SELMAN, A. 1975. A comparison of polynomial time reducibilities. Theoret. Comput. Sci. 1, 2, 103-124.
16. McLEAN, L, AND URKEN, A. 1995. Classics of Social Choice. University of Michigan Press, Ann Arbor, Mich.
17. MEYER, A., AND STOCKMEYER, L. 1972. The equivalence problem for regular expressions with squaring requires exponential space. In Proceedings of the 13th IEEE Symposium on Switching and Automata Theory. IEEE, New York, pp. 125-129.
18. MUELLER, D. 1989. Public Choice II. Cambridge University Press, Cambridge, Mass.
19. NIEMI, R., AND RIKER, W. 1976. The choice of voting systems. Scient. Am. 234, 21-27.
20. PAPADIMITRIOU, C. 1984. On the complexity of unique solutions. J. ACM 31, 2, 392-400.
21. PAPADIMITRIOU, C. 1994. Computational Complexity. Addison-Wesley, Cambridge, Mass.
22. PAPADIMITRIOU, C., AND ZACHOS, S. 1983. Two remarks on the power of counting. In Proceedings of the 6th GI Conference on Theoretical Computer Science. Springer-Verlag Lecture Notes in Computer Science, vol. 145. Springer-Verlag, New York, pp. 269-276.
23. SANKOFF, D., AND KRUSKAL, J., EDS. 1983. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, Reading, Pa.
24. STOCKMEYER, L. 1977. The polynomial-time hierarchy. Theoret. Comput. Sci. 3, 1-22.
25. WAGNER, K. 1987. More complicated questions about maxima and minima, and some closures of NP. Theoret. Comput. Sci. 51, 1-2, 53-80.
26. WAGNER, K. 1990. Bounded query classes. SIAM J. Comput. 19, 5, 833-846.