NP-completeness for calculating power indices of weighted majority games

51Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we prove that both problems for calculating the Banzhaf power index and the Shapley–Shubik power index for weighted majority games are NP-complete.

Author supplied keywords

Cite

CITATION STYLE

APA

Matsui, Y., & Matsui, T. (2001). NP-completeness for calculating power indices of weighted majority games. Theoretical Computer Science, 263(1–2), 305–310. https://doi.org/10.1016/S0304-3975(00)00251-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free