“Buy local” arrangements encourage members of a community or group to patronize one another rather than the external economy. They range from formal mechanisms such as local currencies to informal “I’ll buy from you if you buy from me” arrangements, and are often championed on social...

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

This note provides several generalizations of Mailath's (1987) result that incentive compatibility plus separation implies differentiability. The new results extend the theory to classic models in finance such as Leland and Pyle (1977), Glosten (1989), and De Marzo and Duffie (1999), that were...

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

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 analyze a model in which agents make investments and then match into pairs to create a surplus. The agents can make transfers to reallocate their pretransfer ownership claims on the surplus. Mailath, Postlewaite, and Samuelson (2013) showed that when investments are unobservable, equilibrium...

In repeated normal-form (simultaneous-move) games, simple penal codes (Abreu, 1986, 1988) permit an elegant characterization of the set of subgame-perfect outcomes. We show that the logic of simple penal codes fails in repeated extensive-form games. By means of examples, we identify two types of...

We study stochastic games with an infinite horizon and sequential moves played by an arbitrary number of players. We assume that social memory is finite---every player, except possibly one, is finitely lived and cannot observe events that are sufficiently far back in the past. This class 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 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...