A linear approximation method for the Shapley value
Artificial Intelligence
An anytime approximation method for the inverse Shapley value problem
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Power in threshold network flow games
Autonomous Agents and Multi-Agent Systems
Approximating power indices: theoretical and empirical analysis
Autonomous Agents and Multi-Agent Systems
The inverse shapley value problem
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Complementary cooperation, minimal winning coalitions, and power indices
Theoretical Computer Science
A heuristic approximation method for the Banzhaf index for voting games
Multiagent and Grid Systems
| Hi-index | 0.01 |
Voting power indices enable the analysis of the distribution of power in a legislature or voting body in which different members have different numbers of votes. Although this approach to the measurement of power has been known for a long time, its application to large games has been limited by the difficulty of computing these indices. This paper presents a new method for computing power indices that combines exact methods with an approximate method due to Owen. This method is of most utility in situations where the number of players is large and the voting weights are concentrated in the hands of a small number of members.