We show that for many classes of symmetric two-player games, the simple decision rule “imitate-if-better” can hardly be beaten by any strategy. We provide necessary and sufficient conditions for imitation to be unbeatable in the sense that there is no strategy that can exploit imitation as a...

I consider repeated games with private monitoring played on a network. Each player has a set of neighbors with whom he interacts: a player's payoff depends on his own and his neighbors' actions only. Monitoring is private and imperfect: each player observes his stage payoff but not the actions...

We study a repeated principal–agent model with subjective evaluations. We construct simple bonus-or-terminate incentive schemes. In these schemes, the principal evaluates the agent every T periods. The principal pays a bonus and asks the agent to work for T more periods if the evaluation is...

In the context of an indefinitely repeated veto game, we devise an experiment to distinguish between alternative explanations of generous behavior (accepting negative payoffs): altruism, intrinsic backward-looking reciprocity, and instrumental forward-looking reciprocity. Our results are broadly...

In a multi-stage contest known as a two-player race, players display two fundamental behaviors: (1) the laggard will make a last stand in order to avoid the cost of losing; and (2) the player who is ahead will defend his lead if it is threatened. Last stand behavior, in particular, contrasts...

We consider a dynamic competition game involving three players, in which each player can vary the extent of his competition on a per-rival basis. We call such competition targeted. We show that if the players are myopic, then the weaker players eventually lose the game to their strongest rival....

This note analyzes a two-player all-pay auction with incomplete information. More precisely, one bidder is uncertain about the size of the initial advantage of his rival modeled as a head start in the auction.

I consider repeated games on a network where players interact and communicate with their neighbors. At each stage, players choose actions and exchange private messages with their neighbors. The payoff of a player depends only on his own action and on the actions of his neighbors. At the end of...

This note shows, by means of two simple, three-strategy games, the existence of stable periodic orbits and of multiple, interior steady states in a smooth version of the Best-Response Dynamics, the Logit Dynamics. The main finding is that, unlike Replicator Dynamics, generic Hopf bifurcation and...

This work studies the value of two-person zero-sum repeated games in which at least one of the players is restricted to (mixtures of) bounded recall strategies. A (pure) k-recall strategy is a strategy that relies only on the last k periods of history. This work improves previous results...