Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/329955 
Year of Publication: 
2022
Citation: 
[Journal:] Games [ISSN:] 2073-4336 [Volume:] 13 [Issue:] 3 [Article No.:] 44 [Year:] 2022 [Pages:] 1-14
Publisher: 
MDPI, Basel
Abstract: 
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.
Subjects: 
Monte Carlo algorithm
power index
voting game
weighted majority game
Persistent Identifier of the first edition: 
Additional Information: 
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.
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Appears in Collections:

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.