Pricing traffic in a spanning network

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:

MoreLess

Year of publication:	2014
Authors:	Moulin, Hervé
Published in:	Games and Economic Behavior. - Elsevier, ISSN 0899-8256. - Vol. 86.2014, C, p. 475-490
Publisher:	Elsevier
Subject:	Connection game \| Core stability \| Routing-proofness \| Minimal cost spanning tree or forest

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Classification:	C71 - Cooperative Games ; D63 - Equity, Justice, Inequality, and Other Normative Criteria and Measurement
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010785189