For n-person bargaining problems the family of proportional solutions (introduced and characterized by Kalai in 1977) is generalized to bargaining problems with non-convex payo sets. The so-called "ecient proportional solutions" are characterized axiomatically using natural extensions of the...

In this paper we consider the Minimum Cost Spanning Tree model. We assume that a central planner aims at implementing the minimum cost spanning tree not knowing the true link costs. The central planner sets up a game where agents announce the link costs, a tree is chosen and costs are allocated...

In the present paper we consider the allocation of cost in connection networks. Agents have connection demands in form of pairs of locations they want to be connected. Connections between locations are costly to build. The problem is to allocate costs of networks satisfying all connection...

In this paper we consider a family of cost allocation rules for which agents pay a share of their incremental cost as well as of any ‘debt’ from prior agents. This family encompasses the Bird rule and the free riding rule (where terminal agents pay everything) as the two extreme cases. By...