Access Pricing and Imperfect Competition
No abstract is available for this item.
|Date of creation:||2003|
|Date of revision:|
|Publication status:||Published in in Competitive Transformation of the Postal and Delivery Sector, Michael A. Crew and Paul R. Kleindorfer (eds.), series Topics in Regulatory Economics and Policy , vol. 46, chapter 2, Kluwer, 2004.|
|Contact details of provider:|| Postal: Manufacture des Tabacs, Aile Jean-Jacques Laffont, 21 Allée de Brienne, 31000 TOULOUSE|
Phone: +33 (0)5 61 12 85 89
Fax: + 33 (0)5 61 12 86 37
Web page: http://www.idei.fr/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Sherman, Roger, 2001. "Optimal Worksharing Discounts," Journal of Regulatory Economics, Springer, vol. 19(1), pages 81-92, January.
- Billette de Villemeur, Etienne, et al, 2003. "Optimal Pricing and Price-Cap Regulation in the Postal Sector," Journal of Regulatory Economics, Springer, vol. 24(1), pages 49-62, July.
- J. Gregory Sidak & William Baumol, 1994. "Toward Competition in Local Telephony," Books, American Enterprise Institute, number 52984, 9.
- Armstrong, M. & Doyle, C. & Vickers, J., 1995.
"The access pricing problem: a synthesis,"
Discussion Paper Series In Economics And Econometrics
9532, Economics Division, School of Social Sciences, University of Southampton.
- Laffont, Jean-Jacques & Tirole, Jean, 1996. "Creating Competition through Interconnection: Theory and Practice," Journal of Regulatory Economics, Springer, vol. 10(3), pages 227-56, November.
When requesting a correction, please mention this item's handle: RePEc:ide:wpaper:2219. 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: ()
If references are entirely missing, you can add them using this form.