We characterize, in minimum cost spanning tree problems, the family of rules satisfying monotonicity over cost and population. We also prove that the set of allocations induced by the family coincides with the irreducible core.

We present a new model for cost sharing in minimum cost spanning tree problems, so that the planner can identify the agents that merge. Under this new framework, and as opposed to the traditional model, there exist rules that satisfy merge-proofness. Besides, by strengthening this property and...

A review of the literature on cost sharing solutions for the minimum cost spanning tree problem is proposed, with a particular focus on the folk and Kar solutions. We compare the characterizations proposed, helped by some equivalencies between sets of properties.

This article discusses interactive minimum cost spanning tree problems and argues that the standard approach of using a transferable utility game to come up with a fair allocation of the total costs has some flaws. A new model of spillover games is presented, in which each player’s decision...

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

In the context of cost sharing in minimum cost spanning tree problems, we introduce a property called No Advantageous Merging. This property implies that no group of agents can be better off claiming to be a single node. We show that the sharing rule that assigns to each agent his own connection...

This paper discusses minimum cost spanning tree games and argues that the standard approach of using a transferable utility game to come up with a fair allocation of the total costs has some flaws. A new model of spillover games is presented, in which each agent's decision whether or not to...