On capacity sharing in network congestion epochs
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
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 6 (2004)
Issue (Month): 2 (February)
|Contact details of provider:|| Web page: http://www.springerlink.com/link.asp?id=102537 |
When requesting a correction, please mention this item's handle: RePEc:kap:netnom:v:6:y:2004:i:2:p:87-101. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn)or (Christopher F. Baum)
If references are entirely missing, you can add them using this form.