Abstract
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 demands. We use a few axioms to characterize allocation rules that truthfully implement cost minimizing networks satisfying all connection demands in a game where: (1) a central planner announces an allocation rule and a cost estimation rule; (2) every agent reports her own connection demand as well as all connection costs; (3) the central planner selects a cost minimizing network satisfying reported connection demands based on the estimated costs; and, (4) the planner allocates the true costs of the selected network. It turns out that an allocation rule satisfies the axioms if and only if relative cost shares are fixed.
| Original language | English |
|---|---|
| Journal | Journal of Economic Theory |
| Volume | 157 |
| Pages (from-to) | 76–99 |
| Number of pages | 24 |
| ISSN | 0022-0531 |
| DOIs | |
| Publication status | Published - 1 May 2015 |