Skip to main content
Log in

NP-completeness of some problems concerning voting games

  • Published:
International Journal of Game Theory Aims and scope Submit manuscript

Summary

The problem of confirming lower bounds on the number of coalitions for which an individual is pivoting is NP-complete. Consequently, the problem of confirming non-zero values of power indices is NP-complete. The problem of computing the Absolute Banzhaf index is #P-complete. Related problems for power indices are discussed.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co.

  • Luce RD, Raiffa H (1957) Games and Decisions. Wiley

  • Hoffmann AJ, Wolfe P (1985) History. Chapter 1 in Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (eds) The Traveling Salesman Problem. Wiley

  • Valiant LG (1979) The Complexity of Computing the Permanent. Theoretical Computer Science, 8, 189–201

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Prasad, K., Kelly, J.S. NP-completeness of some problems concerning voting games. Int J Game Theory 19, 1–9 (1990). https://doi.org/10.1007/BF01753703

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation