Pricing traffic in a spanning network

Herve Moulin

Games and Economic Behavior, 2014, vol. 86, issue C, 475-490

Abstract: Users need to connect a pair of target nodes in the network. They share the fixed connection costs of the edge. The system manager elicits target pairs from users, builds the cheapest forest meeting all demands, and choose a cost sharing rule satisfying:

Keywords: Connection game; Core stability; Routing-proofness; Minimal cost spanning tree or forest (search for similar items in EconPapers)
JEL-codes: C71 D63 (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0899825613000845
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:gamebe:v:86:y:2014:i:c:p:475-490

DOI: 10.1016/j.geb.2013.06.002

Access Statistics for this article

Games and Economic Behavior is currently edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().