An approximation method for power indices for voting games


Fatima, S. S, Wooldridge, M and Jennings, Nick (2009) An approximation method for power indices for voting games. In, Proc 2nd Int Workshop on Agent-Based Complex Automated Negotiations, Budapest, Hungary, , 72-86.

Download

[img] PDF - Accepted Version
Download (215Kb)

Description/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.

Item Type: Conference or Workshop Item (Paper)
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Agents, Interactions & Complexity
ePrint ID: 267193
Date Deposited: 18 Mar 2009 08:28
Last Modified: 27 Mar 2014 20:13
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/267193

Actions (login required)

View Item View Item

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