NP-completeness of some problems concerning voting games
- 161 Downloads
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.
KeywordsLower Bound Economic Theory Game Theory Related Problem Power Index
Unable to display preview. Download preview PDF.
- Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co.Google Scholar
- Luce RD, Raiffa H (1957) Games and Decisions. WileyGoogle Scholar
- 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
- Valiant LG (1979) The Complexity of Computing the Permanent. Theoretical Computer Science, 8, 189–201Google Scholar