Consider two agents who learn the value of an unknown parameter by observing a sequence of private signals. Will the agents commonly learn the value of the parameter, i.e., will the true value of the parameter become approximate common-knowledge? If the signals are independent and identically...

We study perfect information games with an infinite horizon played by an arbitrary number of players. This class of games includes infinitely repeated perfect information games, repeated games with asynchronous moves, games with long and short run players, games with overlapping generations of...

A strategy profile in a repeated game has bounded recall L if play under the profile after two distinct histories that agree in the last L periods is equal. Mailath and Morris (2002, 2006) proved that any strict equilibrium in bounded-recall strategies of a game with full support public...

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

A law prohibiting a particular behavior does not directly change the payoff to an individual should he engage in the prohibited behavior. Rather, any change in the individual's payoff, should he engage in the prohibited behavior, is a consequence of changes in other peoples' behavior. If laws do...

We study dynamic moral hazard when the principal can only commit to spot contracts. Principal and agent are ex ante symmetrically uncertain about the difficulty of the job, and update their beliefs on observing output. Since the agent's effort is private, he has an additional incentive to shirk...

Different markets are cleared by different types of prices - seller-specific prices that are uniform across buyers in some markets, and personalized prices tailored to the buyer in others. We examine a setting in which buyers and sellers make investments before matching in a competitive market....

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

We study perfect information games with an infinite horizon played by an arbitrary number of players. This class of games includes infinitely repeated perfect information games, repeated games with asynchronous moves, games with long and short run players, games with overlapping generations of...

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