Advertisement

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

  • Edith Hemaspaandra
  • Lane A. Hemaspaandra
  • Jörg Rothe
Session 3: Computational Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1256)

Abstract

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, i.e., it is complete for Θ 2 p , 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.

Keywords

Vote System Preference Order Condorcet Winner Preference List Polynomial Hierarchy 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BC93]
    D. Bovet and P. Crescenzi. Introduction to the Theory of Complexity. Prentice Hall, 1993.Google Scholar
  2. [Bla58]
    D. Black. Theory of Committees and Elections. Cambridge University Press, 1958.Google Scholar
  3. [BTT89]
    J. Bartholdi III, C. Tovey, and M. Trick. Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare, 6:157–165, 1989.Google Scholar
  4. [Con85]
    M. J. A. N. de Caritat, Marquis de Condorcet. Essai sur l'Application de L'Analyse à la Probabilité des Décisions Rendues à la Pluraliste des Voix. 1785. Facsimile reprint of original published in Paris, 1972, by the Imprimerie Royale.Google Scholar
  5. [Dod76]
    C. Dodgson. A method of taking votes on more than two issues, 1876. Pamphlet printed by the Clarendon Press, Oxford, and headed “not yet published” (see the discussions in [MU95,Bla58], both of which reprint this paper).Google Scholar
  6. [Hem89]
    L. Hemachandra. The strong exponential hierarchy collapses. Journal of Computer and System Sciences, 39(3):299–322, 1989.CrossRefGoogle Scholar
  7. [HHR96]
    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. Technical Report TR-640, University of Rochester, Department of Computer Science, Rochester, NY, October 1996.Google Scholar
  8. [JT95]
    B. Jenner and J. Torán. Computing functions with parallel queries to NP. Theoretical Computer Science, 141(1–2):175–193, 1995.CrossRefGoogle Scholar
  9. [Kad89]
    J. Kadin. pNP[log n] and sparse Turing-complete sets for NP. Journal of Computer and System Sciences, 39(3):282–298, 1989.Google Scholar
  10. [KSW87]
    J. Köhler, U. Schöning, and K. Wagner. The difference and truth-table hierarchies for NP. RAIRO Theoretical Informatics and Applications, 21:419–435, 1987.Google Scholar
  11. [LLS75]
    R. Ladner, N. Lynch, and A. Selman. A comparison of polynomial time reducibilities. Theoretical Computer Science, 1(2): 103–124, 1975.CrossRefGoogle Scholar
  12. [MU95]
    I. McLean and A. Urken. Classics of Social Choice. University of Michigan Press, 1995.Google Scholar
  13. [Mue89]
    D. Mueller. Public Choice II. Cambridge University Press, 1989.Google Scholar
  14. [NR76]
    R. Niemi and W. Riker. The choice of voting systems. Scientific American, 234:21–27, 1976.Google Scholar
  15. [Pap84]
    C. Papadimitriou. On the complexity of unique solutions. Journal of the ACM, 31(2):392–400, 1984.CrossRefGoogle Scholar
  16. [Pap94]
    C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.Google Scholar
  17. [SK83]
    D. Sankoff and J. Kruskal, editors. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, 1983.Google Scholar
  18. [Wag87]
    K. Wagner. More complicated questions about maxima and minima, and some closures of NP. Theoretical Computer Science, 51 (l–2):53–80, 1987.CrossRefGoogle Scholar
  19. [Wag90]
    K. Wagner. Bounded query classes. SIAM Journal on Computing, 19(5):833–846, 1990.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Edith Hemaspaandra
    • 1
  • Lane A. Hemaspaandra
    • 2
  • Jörg Rothe
    • 3
  1. 1.Department of MathematicsLe Moyne CollegeSyracuseUSA
  2. 2.Department of Computer ScienceUniversity of RochesterRochesterUSA
  3. 3.Institut für InformatikFriedrich-Schiller-Universität JenaJenaGermany

Personalised recommendations