A randomised method for the shapely value for the voting game.
A randomised method for the shapely value for the voting game.
The Shapley value is one of the key solution concepts for coalition games. Its main advantage is that it provides a unique and fair solution, but its main problem is that, for many coalition games, the Shapley value cannot be determined in polynomial time. In particular, the problem of finding this value for the voting game is known to be #P-complete in the general case. However, in this paper, we show that there are some specific voting games for which the problem is computationally tractable. For other general voting games, we overcome the problem of computational complexity by presenting a new randomized method for determining the approximate Shapley value. The time complexity of this method is linear in the number of players. We also show, through empirical studies, that the percentage error for the proposed method is always less than 20% and, in most cases, less than 5%.
955-962
Fatima, S.S
70f4072f-e020-41a9-8734-c628491858fe
Wooldridge, M.
955b6c39-0d07-430e-b68d-b9a96d6e14e7
Jennings, N. R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30
2007
Fatima, S.S
70f4072f-e020-41a9-8734-c628491858fe
Wooldridge, M.
955b6c39-0d07-430e-b68d-b9a96d6e14e7
Jennings, N. R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Fatima, S.S, Wooldridge, M. and Jennings, N. R.
(2007)
A randomised method for the shapely value for the voting game.
6th International Joint Conference on Autonomous Agents and Multi-Agent Systems., Hawaii., United States.
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
The Shapley value is one of the key solution concepts for coalition games. Its main advantage is that it provides a unique and fair solution, but its main problem is that, for many coalition games, the Shapley value cannot be determined in polynomial time. In particular, the problem of finding this value for the voting game is known to be #P-complete in the general case. However, in this paper, we show that there are some specific voting games for which the problem is computationally tractable. For other general voting games, we overcome the problem of computational complexity by presenting a new randomized method for determining the approximate Shapley value. The time complexity of this method is linear in the number of players. We also show, through empirical studies, that the percentage error for the proposed method is always less than 20% and, in most cases, less than 5%.
Text
aamas07-shaheen1.pdf
- Other
More information
Published date: 2007
Venue - Dates:
6th International Joint Conference on Autonomous Agents and Multi-Agent Systems., Hawaii., United States, 2007-01-01
Organisations:
Agents, Interactions & Complexity
Identifiers
Local EPrints ID: 264220
URI: http://eprints.soton.ac.uk/id/eprint/264220
PURE UUID: 3b0d29df-1d72-441b-b487-383088c90731
Catalogue record
Date deposited: 22 Jun 2007
Last modified: 14 Mar 2024 07:45
Export record
Contributors
Author:
S.S Fatima
Author:
M. Wooldridge
Author:
N. R. 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