Minimum Cost Connection Networks: Truth-telling and Implementation
Jens Hougaard () and
No 03_2013, MSAP Working Paper Series from University of Copenhagen, Department of Food and Resource Economics
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 demands. We use three 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; and, (3) the central planner selects a cost minimizing network satisfying reported connection demands based on estimated connection costs and allocates true connection costs of the selected network.
Keywords: axiomatic characterization; connection networks; cost sharing; implementation; truth-telling (search for similar items in EconPapers)
JEL-codes: C70 C72 D71 D85 (search for similar items in EconPapers)
Pages: 20 pages
New Economics Papers: this item is included in nep-cdm, nep-gth and nep-net
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
Journal Article: Minimum cost connection networks: Truth-telling and implementation (2015)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:foi:msapwp:03_2013
Access Statistics for this paper
More papers in MSAP Working Paper Series from University of Copenhagen, Department of Food and Resource Economics Contact information at EDIRC.
Bibliographic data for series maintained by Geir Tveit ().