A new stable and more responsive cost sharing solution for minimum cost spanning tree problems

Minimum cost spanning tree (mcst) problems try to connect agents efficiently to a source when agents are located at different points in space and the cost of using an edge is fixed. We introduce a new cost sharing solution that always selects a point in the core and that is more responsive to changes than the well-studied folk solution. The paper shows a sufficient condition for the concavity of the stand-alone cost game. Modifying the game to make sure the condition is satisfied and then taking the Shapley value gives the new solution.