Skip to main content
SpringerLink
Log in

5. Computational complexity

  • Published:
Social Choice and Welfare Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Campbell DE (1977) Computational criteria for voting systems. Br J Pol Sci 7:85–98

    Google Scholar 

  2. Fishburn PC (1983) Dimensions of election procedures: analyses and comparisons. Theory Dec 15:371–397

    Google Scholar 

  3. Hopcroft JE, Ullman JD (1979) Introduction to automata theory, languages and computation. Addison-Wesley, Reading

    Google Scholar 

  4. Kelly JS (1987) Social choice and computational complexity. J Math Econ (forthcoming)

  5. Kim KH, Roush FW (1980) Special domains and nonmanipulability. Math Soc Sci 1:85–92

    Google Scholar 

  6. May KO (1952) A set of independent necessary and sufficient conditions for simple majority decision. Econometrica 20: 680–684

    Google Scholar 

  7. Varian H (1972) Complexity of social decisions (unpublished)

  8. Young HP (1974) An axiomatization of Borda's rule. J Econ Theory 9:43–52

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Economics, Syracuse University, 13244-1090, Syracuse, NY, USA

    J. S. Kelly

Authors
  1. J. S. Kelly
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kelly, J.S. 5. Computational complexity. Soc Choice Welfare 5, 313–317 (1988). https://doi.org/10.1007/BF00433660

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00433660

Keywords

Search

Navigation