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

This paper investigates the Harsanyi (1973)-purifiability of mixed strategies in the repeated prisoners' dilemma with perfect monitoring. We perturb the game so that in each period, a player receives a private payoff shock which is independently and identically distributed across players and...

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

We study dynamic moral hazard with symmetric ex ante uncertainty about the difficulty of the job. The principal and agent update their beliefs about the difficulty as they observe output. Effort is private and the principal can only offer spot contracts. The agent has an additional incentive to...

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

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

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 examine markets in which agents make investments and then match into pairs, creating surpluses that depend on their investments and that can be split between the matched agents. In general, each of the matched agents would ”own" part of the surplus in the absence of interagent transfers....