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.
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
Author information
Authors and Affiliations
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01753703