The University of Southampton
University of Southampton Institutional Repository

An approximation method for power indices for voting games

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
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. pp. 72-86 .

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
Download (221kB)

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: 26 Jun 2020 16:44

Export record

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×