Minimum cost spanning tree problems connect agents efficiently to a source with the cost of using an edge fixed. We revisit the dispute between the Kar and folk solutions, two solution concepts to divide the common cost of connection based on the Shapley value. We introduce a property called...

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...