Abstract
In a weighted majority game each player has a positive integer weight and there is a positive integer quota. A coalition of players is winning (losing) if the sum of the weights of its members exceeds (does not exceed) the quota. A player is pivotal for a coalition if her omission changes it from a winning to a losing one. Most game theoretic measures of the power of a player involve the computation of the number of coalitions for which that player is pivotal. Prasad and Kelly [Prasad, K., Kelly, J.S., 1990. NP-completeness of some problems concerning voting games. International Journal of Game Theory 19, 1–9] prove that the problem of determining whether or not there exists a coalition for which a given player is pivotal is NP-complete. They also prove that counting the number of coalitions for which a given player is pivotal is #P-complete. In the present paper we exhibit classes of weighted majority games for which these problems are easy.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call