Robust collusion with private information

Published in The Review of Economic Studies, 79(2):778–811, April 2012.

Abstract: The 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 payoff-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 payoff environment (Chung & Ely 2006)—a class that includes most typical economic models.

Published article (free access)

Attainable payoffs in repeated games with interdependent private information

Note: Satoru Takahashi discovered an error in a previous version of this paper. I am working on figuring out how to correct it. For now, I am posting a shorter version that contains only the correct results. Please do not cite, circulate, or refer to any version of the paper dated prior to 2009.

Abstract: This paper proves folk theorems for repeated games with private information, communication, and monetary transfers, in which signal spaces may be arbitrary, signals may be statistically interdependent, and payoffs for each player may depend on the signals of other players.

Working paper 1/13/2009