Monte Carlo Methods for Calculating Shapley-Shubik Power Index in Weighted Majority Games

説明

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.

identifier:oai:t2r2.star.titech.ac.jp:50428073

収録刊行物

詳細情報 詳細情報について

問題の指摘

ページトップへ