1. [1] K. Ando: Computation of the Shapley value of minimum cost spanning tree games: #P-hardness and polynomial cases. Japan Journal of Industrial and Applied Mathematics, 29 (2012), 385–400.
2. [2] K. Ando and T. Tokutake: Approximation algorithm for the Shapley value of minimum cost spanning tree games based on sampling (in Japanese). Proceedings of the 2013 Spring National Conference of the Operations Research Society of Japan (2013), 148–149.
3. [3] Y. Bachrach, E. Markakis, E. Resnick, A.D. Procaccia, J.S. Rosenschein and A. Saberi: Approximating power indices: theoretical and empirical analysis. Autonomous Agents and Multi-Agent Systems, 20 (2010), 105–122.
4. [4] C.G. Bird: On cost allocation for a spanning tree. A game theoretic approach. Networks, 6 (1976), 335–350.
5. [5] J. Castro, D. Gómez, E. Molina and J. Tejada: Improving polynomial estimation of the Shapley value by stratified random sampling with optimum allocation. Computers & Operations Research, 82 (2017), 180–188.