This paper surveys work on reputations in repeated games of incomplete information. We first develop the adverse-selection approach to reputations in the context of a long-lived player, who may be a “normal” type or one of a number of “commitment” types, and who faces a succession of...

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...

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...