Robust Collusion with Private Information
AbstractThe game-theoretic literature on collusion has been hard pressed to explain why a cartel should engage in price wars, without resorting to either impatience, symmetry restrictions, inability to communicate, or failure to optimize. This paper introduces a new explanation that relies on none of these assumptions: if the cartel's member firms have private information about their costs, price wars can be optimal in the face of complexity. Specifically, equilibria that are robust to pay-off irrelevant disruptions of the information environment generically cannot attain or approximate efficiency. An optimal robust equilibrium must allocate market shares inefficiently and may call for price wars under certain conditions. For a two-firm cartel, cost interdependence is a sufficient condition for price wars to arise in an optimal robust equilibrium. That optimal equilibria are inefficient generically applies not only to collusion games but also to the entire separable pay-off environment--a class that includes most typical economic models. Copyright 2012, Oxford University Press.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Oxford University Press in its journal The Review of Economic Studies.
Volume (Year): 79 (2012)
Issue (Month): 2 ()
Contact details of provider:
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Yuichi Yamamoto, 2012. "Individual Learning and Cooperation in Noisy Repeated Games," PIER Working Paper Archive 12-044, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
- Andreas Blume & April M. Franco & Paul Heidhues, 2011.
"Dynamic coordination via organizational routines,"
ESMT Research Working Papers
ESMT-11-10, ESMT European School of Management and Technology.
- Andreas Blume, 2011. "Dynamic Coordination Via Organizational Routines," Working Papers 439, University of Pittsburgh, Department of Economics, revised Jan 2011.
- Blume, Andreas & Franco, April Mitchell & Heidhues, Paul, 2011. "Dynamic Coordination via Organizational Routines," Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 355, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
- Joao Correia-da-Silva, 2013. "Impossibility of market division with two-sided private information about production costs," FEP Working Papers 490, Universidade do Porto, Faculdade de Economia do Porto.
- Yuichi Yamamoto, 2013. "Individual Learning and Cooperation in Noisy Repeated Games," PIER Working Paper Archive 13-038, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Oxford University Press) or (Christopher F. Baum).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.