We show that the playing sequence-the order in which players update their actions-is a crucial determinant of whether the best-response dynamic converges to a Nash equilibrium. Specifically, we analyze the probability that the best-response dynamic converges to a pure Nash equilibrium in random...

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 convex categories. We give a full characterization of...

We report experiments designed to test between Nash equilibria that are stable and unstable under learning. The “TASP” (Time Average of the Shapley Polygon) gives a precise prediction about what happens when there is divergence from equilibrium under fictitious play like learning processes....

We propose a learning dynamic with agents using samples of past play to estimate the distribution of other players' strategy choices and best responding to this estimate. To account for noisy play, estimated distributions over other players' strategy choices have full support in the other...

We apply the dynamic stochastic framework proposed by recent evolutionaryliterature to the class of strict supermodular games when two simplebehavior rules coexist in the population, imitation and myopic optimization.We assume that myopic optimizers are able to see how well their payoff...

The novelty of our model is to combine models of collective action on networks with models of social learning. Agents are connected according to an undirected graph, the social network, and have the choice between two actions: either to adopt a new behavior or technology or stay with the default...

In a coordination game such as the Battle of the Sexes, agents can condition their plays on external signals that can, in theory, lead to a Correlated Equilibrium that can improve the overall payoffs of the agents. Here we explore whether boundedly rational, adaptive agents can learn to...

We report on an experiment examining behavior and equilibrium selection in two similar, infinitely repeated games, Stag Hunt and Prisoner's Dilemma under anonymous random matching. We are interested in the role that precedents may play for equilibrium selection between these two stage game...

We report laboratory experiments that use new, visually oriented software to explore the dynamics of 3 x 3 games with intransitive best responses. Each moment, each player is matched against the entire population, here 8 human subjects. A "heat map" offers instantaneous feedback on current...

Two individuals are involved in a conflict situation in which preferences are ex ante uncertain. While they eventually learn their own preferences, they have to pay a small cost if they want to learn their opponent's preferences. We show that, for sufficiently small positive costs of information...