Price and Capacity Competition
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.
|Date of creation:||Dec 2006|
|Date of revision:|
|Publication status:||published as Acemoglu, Daron & Bimpikis, Kostas & Ozdaglar, Asuman, 2009. "Price and capacity competition," Games and Economic Behavior, Elsevier, vol. 66(1), pages 1-26, May.|
|Note:||CF EFG IO|
|Contact details of provider:|| Postal: |
Web page: http://www.nber.org
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.:
- Martin J. Osborne & Ariel Rubinstein, 1994.
"A Course in Game Theory,"
MIT Press Books,
The MIT Press,
edition 1, volume 1, number 0262650401, June.
- Dasgupta, Partha & Maskin, Eric, 1986. "The Existence of Equilibrium in Discontinuous Economic Games, I: Theory," Review of Economic Studies, Wiley Blackwell, vol. 53(1), pages 1-26, January.
- David M. Kreps & Jose A. Scheinkman, 1983. "Quantity Precommitment and Bertrand Competition Yield Cournot Outcomes," Bell Journal of Economics, The RAND Corporation, vol. 14(2), pages 326-337, Autumn.
- Natalia Fabra & Nils-Henrik von der Fehr & David Harbord, 2002.
"Designing Electricity Auctions,"
0211017, EconWPA, revised 31 Aug 2003.
- Daron Acemoglu & Asuman Ozdaglar, 2005.
"Competition and Efficiency in Congested Markets,"
NBER Working Papers
11201, National Bureau of Economic Research, Inc.
- Drew Fudenberg & Jean Tirole, 1991. "Game Theory," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262061414, June.
- Richard E. Levitan & Martin Shubik, 1970. "Duopoly with Price and Quantity as Strategic Variables," Cowles Foundation Discussion Papers 289, Cowles Foundation for Research in Economics, Yale University.
When requesting a correction, please mention this item's handle: RePEc:nbr:nberwo:12804. 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.