Monte Carlo methods for the Shapley-Shubik power index

Yuto Ushioda, Masato Tanaka and Tomomi Matsui

This paper deals with the problem of calculating the Shapley-Shubik power index in weighted majority games. We propose an efficient Monte Carlo algorithm based on an implicit hierarchical structure of permutations of players. Our algorithm outputs a vector of power indices preserving the monotonicity, with respect to the voting weights. We show that our algorithm reduces the required number of samples, compared with the naive algorithm.

MoreLess

Year of publication:	2022
Authors:	Ushioda, Yuto ; Tanaka, Masato ; Matsui, Tomomi
Published in:	Games. - Basel : MDPI, ISSN 2073-4336, ZDB-ID 2527220-2. - Vol. 13.2022, 3, Art.-No. 44, p. 1-14
Subject:	Monte Carlo algorithm \| power index \| voting game \| weighted majority game \| Monte-Carlo-Simulation \| Monte Carlo simulation \| Spieltheorie \| Game theory \| Abstimmungsspiel \| Voting game \| Abstimmungsregel \| Voting rule \| Shapley-Wert \| Shapley value \| Algorithmus \| Algorithm

freely available

Full text |

More access options

doi.org

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

Type of publication:	Article
Type of publication (narrower categories):	Aufsatz in Zeitschrift ; Article in journal
Language:	English
Notes:	"This paper is an extended version of our paper published in the 21st Japan-Korea Joint Workshop on Algorithms and Computation (WAAC), Fukuoka, Japan, 26–27 August 2018." - Fußnote
Other identifiers:	10.3390/g13030044 [DOI]
Source:	ECONIS - Online Catalogue of the ZBW

Persistent link: https://www.econbiz.de/10013252753