Fatima, S. S, Wooldridge, M and Jennings, Nick
An approximation method for power indices for voting games
At Proc 2nd Int Workshop on Agent-Based Complex Automated Negotiations, Hungary.
The Shapley value and Banzhaf index are two well known indices for measuring the power a player has in a voting game. However, the problem of computing these indices is computationally hard. To overcome this problem, we analyze approximation methods for computing these indices. Although these methods have polynomial time complexity, finding an approximate Shapley value using them is easier than finding an approximate Banzhaf index. We also find the absolute error for the methods and show that this error for the Shapley value is lower than that for the Banzhaf index.
Conference or Workshop Item
|Venue - Dates:
||Proc 2nd Int Workshop on Agent-Based Complex Automated Negotiations, Hungary, 2009-01-01
||Agents, Interactions & Complexity
||18 Mar 2009 08:28
||17 Apr 2017 18:52
|Further Information:||Google Scholar|
Actions (login required)