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

Intensive studies on indirect reciprocity have explored rational assessment rules for maintaining cooperation and several have demonstrated the effects of the stern-judging rule. Uchida and Sasaki demonstrated that the stern-judging rule is not suitable for maintaining cooperative regimes in...

We study the design of mechanisms that implement Lindahl or Walrasian allocations and whose Nash equilibria are dynamically stable for a wide class of adaptive dynamics. We argue that supermodularity is not a desirable stability criterion in this mechanism design context, focusing instead on...

Despite the accumulation of research on indirect reciprocity over the past 30 years and the publication of over 100,000 related papers, there are still many issues to be addressed. Here, we look back on the research that has been done on indirect reciprocity and identify the issues that have...

We present a new approach to studying equilibrium dynamics in a class of stochastic games with a continuum of players with private types and strategic complementarities. We introduce a suitable equilibrium concept, called Markov Stationary Nash Distributional Equilibrium (MSNDE), prove its...

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

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 analyze a game in which players with unique information are arranged in a hierarchy. In the lowest layer each player can decide in each of several rounds either to pass the information to his successor or to hold. While passing generates an immediate payoff according to the value of...

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

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