The 21st Japan–Korea Joint Workshop on Algorithms and Computation
Conference site
Japanese:
English:
Fukuoka
File
Abstract
This paper addresses Monte Carlo algorithms for calculating the Shapley-Shubik power index in weighted majority games. First, we analyze a naive Monte Carlo algorithm and discuss the required number of samples. We then propose an efficient Monte Carlo algorithm and show that our algorithm reduces the required number of samples as compared to the naive algorithm.