Advertisement

International Journal of Game Theory

, Volume 19, Issue 1, pp 1–9 | Cite as

NP-completeness of some problems concerning voting games

  • K. Prasad
  • J. S. Kelly
Article

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.

Keywords

Lower Bound Economic Theory Game Theory Related Problem Power Index 
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. Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co.Google Scholar
  2. Luce RD, Raiffa H (1957) Games and Decisions. WileyGoogle Scholar
  3. Hoffmann AJ, Wolfe P (1985) History. Chapter 1 in Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (eds) The Traveling Salesman Problem. WileyGoogle Scholar
  4. Valiant LG (1979) The Complexity of Computing the Permanent. Theoretical Computer Science, 8, 189–201Google Scholar

Copyright information

© Physica-Verlag 1990

Authors and Affiliations

  • K. Prasad
    • 1
  • J. S. Kelly
    • 2
  1. 1.Department of EconomicsFlorida State UniversityTallahasseeUSA
  2. 2.Department of EconomicsSyracuse UniversitySyracuseUSA

Personalised recommendations