This paper addresses the question of whether agents will invest efficiently in attributes that will increase their productivity in subsequent matches with other individuals. We present a two-sided matching model in which buyers and sellers make investment decisions prior to a matching stage....

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

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 provide several generalizations of Mailath's (1987) result that in games of asymmetric information with a continuum of types incentive compatibility plus separation implies differentiability of the informed agent's strategy. The new results extend the theory to classic models in finance such...

We provide several generalizations of Mailathʼs (1987) [9] result that in games of asymmetric information with a continuum of types incentive compatibility plus separation implies differentiability of the informed agentʼs strategy. The new results extend the theory to classic models in finance...

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

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

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