Abstract

 
 

Citations (1)



 
 

Footnotes (8)



 


 



Price and Capacity Competition


Daron Acemoglu


Massachusetts Institute of Technology (MIT) - Department of Economics; Centre for Economic Policy Research (CEPR); National Bureau of Economic Research (NBER)

Kostas Bimpikis


Massachusetts Institute of Technology (MIT) - Operations Research Center

Asuman E. Ozdaglar


Massachusetts Institute of Technology (MIT) - Department of Electrical Engineering and Computer Science

December 12, 2006

MIT Department of Economics Working Paper No. 06-37

Abstract:     
We study the efficiency of oligopoly equilibria in a model where firms compete over capacities and prices. The motivating example is a communication network where service providers invest in capacities and then compete in prices. Our model economy corresponds to a two-stage game. First, firms (service providers) independently choose their capacity levels. Second, after the capacity levels are observed, they set prices. Given the capacities and prices, users (consumers) allocate their demands across the firms. We first establish the existence of pure strategy subgame perfect equilibria (oligopoly equilibria) and characterize the set of equilibria. These equilibria feature pure strategies along the equilibrium path, but off-the-equilibrium path they are supported by mixed strategies. We then investigate the efficiency properties of these equilibria, where efficiency is defined as the ratio of surplus in equilibrium relative to the first best. We show that efficiency in the worst oligopoly equilibria of this game can be arbitrarily low. However, if the best oligopoly equilibrium is selected (among multiple equilibria), the worst-case efficiency loss has a tight bound, approximately equal to 5/6 with 2 firms. This bound monotonically decreases towards zero when the number of firms increases. We also suggest a simple way of implementing the best oligopoly equilibrium. With two firms, this involves the lower-cost firm acting as a Stackelberg leader and choosing its capacity first. We show that in this Stackelberg game form, there exists a unique equilibrium corresponding to the best oligopoly equilibrium. We also show that an alternative game form where capacities and prices are chosen simultaneously always fails to have a pure strategy equilibrium. These results suggest that the timing of capacity and price choices in oligopolistic environments is important both for the existence of equilibrium and for the extent of efficiency losses in equilibrium.

Number of Pages in PDF File: 39

Keywords: capacity, competition, efficiency loss, industry structure, investment oligopoly

JEL Classification: C72, L13

working papers series


Download This Paper

Date posted: December 23, 2006  

Suggested Citation

Acemoglu, Daron, Bimpikis, Kostas and Ozdaglar, Asuman E., Price and Capacity Competition (December 12, 2006). MIT Department of Economics Working Paper No. 06-37. Available at SSRN: http://ssrn.com/abstract=953117 or http://dx.doi.org/10.2139/ssrn.953117

Contact Information

Daron Acemoglu (Contact Author)
Massachusetts Institute of Technology (MIT) - Department of Economics ( email )
50 Memorial Drive
Room E52-380b
Cambridge, MA 02142
United States
617-253-1927 (Phone)
617-253-1330 (Fax)
Centre for Economic Policy Research (CEPR)
77 Bastwick Street
London, EC1V 3PZ
United Kingdom
National Bureau of Economic Research (NBER)
1050 Massachusetts Avenue
Cambridge, MA 02138
United States
Kostas Bimpikis
Massachusetts Institute of Technology (MIT) - Operations Research Center ( email )
77 Massachusetts Avenue
Bldg. E 40-149
Cambridge, MA 02139
United States
Asuman E. Ozdaglar
Massachusetts Institute of Technology (MIT) - Department of Electrical Engineering and Computer Science ( email )
50 Memorial Drive
Cambridge, MA 02139-4307
United States
617-324-0058 (Phone)
Feedback to SSRN (Beta)


Paper statistics
Abstract Views: 670
Downloads: 123
Download Rank: 103,380
Citations:  1
Footnotes:  8

© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.  FAQ   Terms of Use   Privacy Policy   Copyright
This page was processed by apollo4 in 0.766 seconds