|
|
||||||||
Department of Economics, Massachusetts Institute of Technology, E52-380B, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139
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
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
2 2 with positive latency at zero flow. These bounds are tight even when the numbers of routes and oligopolists are arbitrarily large.
History: Received: February 18, 2005;
revision received: August 6, 2005;
This article has been cited by other articles:
![]() |
P. Maille and N. E. Stier-Moses Eliciting Coordination with Rebates Transportation Science, November 1, 2009; 43(4): 473 - 492. [Abstract] [PDF] |
||||
![]() |
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] |
||||
![]() |
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] |
||||
![]() |
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 |