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
収録刊行物
-
- Proceedings of WAAC2018
-
Proceedings of WAAC2018 2018-08
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1050292572143497216
-
- NII論文ID
- 120006705545
-
- 本文言語コード
- en
-
- 資料種別
- conference paper
-
- データソース種別
-
- IRDB
- CiNii Articles