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

We offer an axiomatization of the serial cost-sharing method of Friedman and Moulin (1999). The key property in our axiom system is Group Demand Monotonicity, asking that when a group of agents raise their demands, not all of them should pay less.

A group of agents participate in a cooperative enterprise producing a single good. Each participant contributes a particular type of input; output is nondecreasing in these contributions. How should it be shared? We analyze the implications of the axiom of Group Monotonicity: if a group of...

We offer an axiomatization of the serial cost-sharing method of Friedman and Moulin (1999). The key property in our axiom system is Group Demand Monotonicity, asking that when a group of agents raise their demands, not all of them should pay less.

Consider a problem in which the cost of building an irrigation canal has to be divided among a set of people. Each person has different needs. When the needs of two or more people overlap, there is congestion. In problems without congestion, a unique canal serves all the people and it is enough...

We consider an extension of minimum cost spanning tree (mcst) problems in which some agents do not need to be connected to the source, but might reduce the cost of others to do so. Even if the cost usually cannot be computed in polynomial time, we extend the characterization of the Kar solution...

Suppose that a group have demands for some good. Each one of them owns a technology to produce the good, with these technologies varying in their effectiveness. We consider technologies exhibiting either increasing return to scale (IRS) or decreasing returns to scale (DRS). In each case, we...

We consider an extension of minimum cost spanning tree (mcst) problems where some agents do not need to be connected to the source, but might reduce the cost of others to do so. Even if the cost usually cannot be computed in polynomial time, we extend the characterization of the Kar solution...