This note characterizes the set A¡∞ of actions of player ¡ that are uniquely rationalizable for some hierarchy of beliefs on an arbitrary space of uncertainty. It is proved that for any rationalizable action a¡ for the type t¡, if a¡ belongs to A¡∞ and is justified by conjectures...

We investigate whether two players in a long-run relationship can maintain cooperation when the details of the underlying game are unknown. Specifically, we consider a new class of repeated games with private monitoring, where an unobservable state of the world influences the payoff functions...

This paper, prepared for the Handbook of Game Theory, volume 4 (Peyton Young and Shmuel Zamir, editors, Elsevier Press), surveys work on reputations in repeated games of incomplete information.

We investigate whether two players in a long-run relationship can maintain cooperation when the details of the underlying game are unknown. Specifically, we consider a new class of repeated games with private monitoring, where an unobservable state of the world influences the payoff functions...

This article gives a brief introduction to reputation effects. A canonical model is described, the reputation bound result of Fudenberg and Levine (1989 1992) and the temporary reputation result of Cripps, Mailath, and Samuelson (2004, 2007) are stated and discussed.

In McLean and Postlewaite (2002), we analyzed pure exchange economies with asymmetrically informed agents. We defined a notion of informational size and showed that, when the aggregate information of all agents resolves nearly all the uncertainty regarding the state of nature, the conflict...

We formulate a notion of stable outcomes in matching problems with one-sided asymmetric information. The key conceptual problem is to formulate a notion of a blocking pair that takes account of the inferences that the uninformed agent might make from the hypothesis that the current allocation is...

A large literature uses matching models to analyze markets with two-sided heterogeneity, studying problems such as the matching of students to schools, residents to hospitals, husbands to wives, and workers to firms. The analysis typically assumes that the agents have complete information, and...

We formulate a notion of stable outcomes in matching problems with one-sided asymmetric information. The key conceptual problem is to formulate a notion of a blocking pair that takes account of the inferences that the uninformed agent might make. We show that the set of stable outcomes is...

This paper, prepared for the Handbook of Game Theory, volume 4 (Peyton Young and Shmuel Zamir, editors, Elsevier Press), surveys work on reputations in repeated games of incomplete information.