MONTE CARLO ALGORITHM FOR CALCULATING THE SHAPLEY VALUES OF MINIMUM COST SPANNING TREE GAMES
-
- Ando Kazutoshi
- Shizuoka University
-
- Takase Koichi
- Shizuoka University
Search this article
Abstract
<p>In this paper, we address a Monte Carlo algorithm for calculating the Shapley values of minimum cost spanning tree games. We provide tighter upper and lower bounds for the marginal cost vector and improve a previous study's lower bound on the number of permutations required for the output of the algorithm to achieve a given accuracy with a given probability. In addition, we present computational experiments for estimating the lower bound on the number of permutations required by the Monte Carlo algorithm. </p>
Journal
-
- Journal of the Operations Research Society of Japan
-
Journal of the Operations Research Society of Japan 63 (1), 31-40, 2020-01-31
The Operations Research Society of Japan
- Tweet
Details 詳細情報について
-
- CRID
- 1390846609801396608
-
- NII Article ID
- 130007792573
-
- NII Book ID
- AA00703935
-
- ISSN
- 21888299
- 04534514
-
- NDL BIB ID
- 030213062
-
- Text Lang
- en
-
- Data Source
-
- JaLC
- NDL
- Crossref
- CiNii Articles
- KAKEN
-
- Abstract License Flag
- Disallowed