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.

翻译：本文讨论蒙特卡洛在加权多数游戏中计算 Shapley-Shubik 功率指数的计算算法。 首先,我们分析一个天真的蒙特卡洛算法,并讨论所需的样本数量。 然后我们提出一个高效的蒙特卡洛算法,并表明我们的算法比天真的算法减少了所需的样本数量。