Abstract
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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1-9 |
| Number of pages | 9 |
| Journal | International Journal of Game Theory |
| Volume | 19 |
| Issue number | 1 |
| DOIs | |
| State | Published - Mar 1990 |
ASJC Scopus subject areas
- Statistics and Probability
- Mathematics (miscellaneous)
- Social Sciences (miscellaneous)
- Economics and Econometrics
- Statistics, Probability and Uncertainty