Correlation of players' actions may evolve in the common course of the play of a repeated game with perfect monitoring (“online correlation”). In this paper we study the concealment of such correlation from a boundedly rational player. We show that “strong” players, i.e., players whose...

This paper examines a dynamic process of unilateral and joint deviations of agents and the resulting stochastic evolution of social conventions. Our model unifies stochastic stability analysis in static settings, including normal form games, network formation games, and simple exchange...

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.

This paper analyzes the ability of group members to cooperate in rent-seeking activities in a context of between-group competition. For this purpose, we develop an infinitely repeated rent-seeking game between two groups of different size. We first investigate Nash reversion strategies to...

This paper aspires to fill a conspicuous gap in the literature regarding learning in games—the absence of empirical verification of learning rules involving pattern recognition. Weighted fictitious play is extended to detect two-period patterns in opponentsʼ behavior and to comply with the...

In a game of common interest there is one action vector that all players prefer to every other. Yet there may be multiple Pareto-ranked Nash equilibria in the game and the “coordination problem” refers to the fact that rational equilibrium play cannot rule out Pareto-dominated equilibria. In...

We prove a folk theorem for stochastic games with private, almost-perfect monitoring and observable states when the limit set of feasible and individually rational payoffs is independent of the state. This asymptotic state independence holds, for example, for irreducible stochastic games. Our...

We study a communication game of common interest in which the sender observes one of infinite types and sends one of finite messages which is interpreted by the receiver. In equilibrium there is no full separation but types are clustered into contiguous cells. We give a full characterization of...

This paper introduces a new coordination problem for a large but finite population – The Language Game. The population is partitioned into two groups of identical agents. Each player shares a common two-action strategy set and interacts pairwise with everyone else. Both symmetric profiles are...

We introduce a “dynamic non-equivalent utilities” (DNEU) condition and the notion of dynamic player-specific punishments for a general repeated game with unequal discounting, both naturally generalizing the stationary counterparts in Abreu et al. (1994). We show that if the DNEU condition,...