An approximation method for power indices for voting games
An approximation method for power indices for voting games
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.
72-86
Fatima, S. S
288cde10-5370-408c-8083-dc7307e5fe87
Wooldridge, M
711a6c61-aec7-492d-bcf6-e08cb07d9286
Jennings, Nick
ab3d94cc-247c-4545-9d1e-65873d6cdb30
2009
Fatima, S. S
288cde10-5370-408c-8083-dc7307e5fe87
Wooldridge, M
711a6c61-aec7-492d-bcf6-e08cb07d9286
Jennings, Nick
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Fatima, S. S, Wooldridge, M and Jennings, Nick
(2009)
An approximation method for power indices for voting games.
Proc 2nd Int Workshop on Agent-Based Complex Automated Negotiations, Budapest, Hungary.
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
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.
Text
p.pdf
- Accepted Manuscript
More information
Published date: 2009
Venue - Dates:
Proc 2nd Int Workshop on Agent-Based Complex Automated Negotiations, Budapest, Hungary, 2009-01-01
Organisations:
Agents, Interactions & Complexity
Identifiers
Local EPrints ID: 267193
URI: http://eprints.soton.ac.uk/id/eprint/267193
PURE UUID: beb5a0b9-3207-4e4c-9ad4-8226fb07884e
Catalogue record
Date deposited: 18 Mar 2009 08:28
Last modified: 14 Mar 2024 08:44
Export record
Contributors
Author:
S. S Fatima
Author:
M Wooldridge
Author:
Nick Jennings
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics