Mathematics of Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


MATHEMATICS OF OPERATIONS RESEARCH
Vol. 32, No. 1, February 2007, pp. 1-31
DOI: 10.1287/moor.1060.0231
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Acemoglu, D.
Right arrow Articles by Ozdaglar, A.
Right arrow Search for Related Content

Competition and Efficiency in Congested Markets

Daron Acemoglu, Asuman Ozdaglar

Department of Economics, Massachusetts Institute of Technology, E52-380B, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139
Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 32-D630, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139

daron{at}mit.edu, http://econ-www.mit.edu/faculty/?prof_id=acemoglu
asuman{at}mit.edu, http://web.mit.edu/asuman/www

We study the efficiency of oligopoly equilibria (OE) in congested markets. The motivating examples are the allocation of network flows in a communication network or of traffic in a transportation network. We show that increasing competition among oligopolists can reduce efficiency, measured as the difference between users’ willingness to pay and delay costs. We characterize a tight bound of 5/6 on efficiency in pure strategy equilibria when there is zero latency at zero flow and a tight bound of 2{surd}2 – 2 with positive latency at zero flow. These bounds are tight even when the numbers of routes and oligopolists are arbitrarily large.

Key Words: pricing; competition; congestion externalities; Wardrop equilibrium; social optimum; oligopoly equilibrium; efficiency; price of anarchy
History: Received: February 18, 2005; revision received: August 6, 2005;


This article has been cited by other articles:


Home page
Transportation ScienceHome page
P. Maille and N. E. Stier-Moses
Eliciting Coordination with Rebates
Transportation Science, November 1, 2009; 43(4): 473 - 492.
[Abstract] [PDF]


Home page
Mathematics of Operations ResearchHome page
P. Dupuis, K. Leder, and H. Wang
Importance Sampling for Weighted-Serve-the-Longest-Queue
Mathematics of Operations Research, August 1, 2009; 34(3): 642 - 660.
[Abstract] [PDF]


Home page
Operations ResearchHome page
D. L. Alderson
OR FORUM--Catching the "Network Science" Bug: Insight and Opportunity for the Operations Researcher
Operations Research, September 1, 2008; 56(5): 1047 - 1065.
[Abstract] [PDF]


Home page
Management ScienceHome page
G. Perakis and G. Roels
The Price of Anarchy in Supply Chains: Quantifying the Efficiency of Price-Only Contracts
Management Science, August 1, 2007; 53(8): 1249 - 1268.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2007 by INFORMS.