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 paper constructs the equilibrium for a specific code that can be seen as a “universal grammar” in a class of common interest Sender–Receiver games where players communicate through a noisy channel. We propose a Senderʼs signaling strategy which does not depend on either the game...

We study a stochastic version of Fudenberg–Tirole's preemption game. Two firms contemplate entering a new market with stochastic demand. Firms differ in sunk costs of entry. If the demand process has no upward jumps, the low cost firm enters first, and the high cost firm follows. If leader's...

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

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

We experimentally assess the predictive power of two equilibrium selection principles for binary N-player entry games with strategic complementarities. In static entry games, we test the theory of global games which posits that players play games of complete information as if they were playing a...

Stochastic best response models provide sharp predictions about equilibrium selection when the noise level is arbitrarily small. The difficulty is that, when the noise is extremely small, it can take an extremely long time for a large population to reach the stochastically stable equilibrium. An...

A recent literature in evolutionary game theory is devoted to the question of robust equilibrium selection under noisy best-response dynamics. In this paper we present a complete picture of equilibrium selection for asymmetric binary choice coordination games in the small noise limit. We achieve...