We show that computing the Shapley value of minimum cost spanning tree games is #P-hard even if the cost functions are restricted to be {0, 1}-valued. The proof is by a reduction from counting the number of minimum 2-terminal vertex cuts of an undirected graph, which is #P-complete. We also investigate minimum cost spanning tree games whose Shapley values can be computed in polynomial time. We ...
