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

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

This paper provides an axiomatic characterization of a family of so-called efficient maxmin solutions which can be seen as generalizations of the Kalai-Smorodinsky solution to nonconvex n-person bargaining problems. Moreover, it is shown that even though there are several efficient maxmin...

This paper provides an axiomatic characterization of a family of so-called efficient maxmin solutions which can be seen as generalizations of the Kalai-Smorodinsky solution to nonconvex n-person bargaining problems. Moreover, it is shown that even though there are several efficient maxmin...