On capacity sharing in network congestion epochs

Diego Lanzi

Netnomics, 2004, vol. 6, issue 2, 87-101

Abstract: Seeing network resources as a public good involves to mantain open and shared access to them for any user. Nevertheless, these conditions may be really difficult to achieve in presence of well-endowed users with heavy data flows. Our purpose here is to provide a two stage game form for managing heavy data flows which may cause network congestion or monopolization. Using an axiomatic approach, we show that the mechanism proposed attains economic efficiency and it implements capacity sharing. Copyright Kluwer Academic Publishers 2004

Keywords: capacity sharing; congested networks; subgame implementation (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s11066-004-0834-3 (text/html)
Access to full text is restricted to subscribers.

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:kap:netnom:v:6:y:2004:i:2:p:87-101

Ordering information: This journal article can be ordered from
http://www.springer. ... ry/journal/11066/PS2

DOI: 10.1007/s11066-004-0834-3

Access Statistics for this article

Netnomics is currently edited by Stefan Voß

More articles in Netnomics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().