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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have