We study large-population repeated games where players are symmetric but not anonymous, so player-specific rewards and punishments are feasible. Players may be commitment types who always take the same action. Even though players are not anonymous, we show that an anti-folk theorem holds when...

We explore the conditions under which the "first-order approach" (FO-approach) can be used to characterize profit maximizing contracts in dynamic principal-agent models. The FO-approach works when the resulting FO-optimal contract satisfies a particularly strong form of monotonicity in types, a...

This paper studies repeated games with incomplete information on one side and equal discount factors for both players. The payoffs of the informed player I depend on one of two possible states of the world, which is known to her. The payoffs of the uninformed player U do not depend on the state...

Abstract. We analyze discounted repeated games with incomplete information, such that the players' payoffs depend only on their own type (known-own payoff case). We describe an algorithm for finding all equilibrium payoffs in games for which there exists an open set of belief-free equilibria of...

We study chip-strategy equilibria in two-player repeated games. Intuitively, in these equilibria players exchange favors by taking individually suboptimal actions if these actions create a "gain" for the opponent larger than the player's "loss" from taking them. In exchange, the player who...

This paper departs from the standard profit-maximizing model of firm behavior by assuming that firms are motivated in part by personal animosity-or respect-towards their competitors. A reciprocal firm responds to unkind behavior of rivals with unkind actions (negative reciprocity), while at the...

Some private-monitoring games, that is, games with no public histories, can have histories that are almost public. These games are the natural result of perturbing public monitoring games towards private monitoring. We explore the extent to which it is possible to coordinate continuation play in...

We analyze the extent to which efficient trade is possible in an ongoing relationship between impatient agents with hidden valuations (i.i.d. over time), restricting attention to equilibria that satisfy ex post incentive constraints in each period. With ex ante budget balance, efficient trade...

We study impersonal exchange, and ask how agents can behave honestly in anonymous transactions without contracts. We analyze repeated anonymous random matching games, where agents observe only their own transactions. Little is known about cooperation in this setting beyond the prisoner's...

In the context of repeated first-price auctions, we explore how a bid-rigging cartel can simultaneously overcome the difficulty of soliciting truthful private information about valuations and the difficulty of enforcing its internal mechanism. Focusing on the class of trigger-strategy collusive...