In Young (1993, 1998) agents are recurrently matched to play a finite game and almost always play a myopic best reply to a frequency distribution based on a sample from the recent history of play. He proves that in a generic class of finite n-player games, as the mutation rate tends to zero,...

In this paper I define an evolutionary stability criterion for learning rules. Using Monte Carlo simulations, I then apply this criterion to a class of learning rules that can be represented by Camerer and Ho's (1999) model of learning. This class contains perturbed versions of reinforcement and...

In this paper, I analyze stochastic adaptation in finite n-player games played by heterogeneous populations of myopic best repliers, better repliers and imitators. In each period, one individual from each of n populations, one for each player role, is drawn to play and chooses a pure strategy...

In this paper, I analyze stochastic adaptation in finite n-player games played by heterogeneous populations of myopic best repliers, better repliers and imitators. In each period, one individual from each of n populations, one for each player role, is drawn to play and chooses a pure strategy...

In this paper I define an evolutionary stability criterion for learning rules. Using Monte Carlo simulations, I then apply this criterion to a class of learning rules that can be represented by Camerer and Ho's (1999) model of learning. This class contains perturbed versions of reinforcement and...

In this paper we model an evolutionary process with perpetual random shocks where individual behavior is determined by imitation. Every period an agent is randomly chosen from each of n finite populations to play a game. Each agent observes a sample of population-specific past strategy and...

In Young (1993, 1998) agents are recurrently matched to play a finite game and almost always play a myopic best reply to a frequency distribution based on a sample from the recent history of play. He proves that in a generic class of finite n-player games, as the mutation rate tends to zero,...

We consider a basic stochastic evolutionary model with rare mutation and a best-reply (or better-reply) selection mechanism. Following Young's papers, we call a state stochastically stable if its long-term relative frequency of occurrence is bounded away from zero as the mutation rate decreases...

We consider a basic stochastic evolutionary model with rare mutation and a best-reply (or better-reply) selection mechanism. Following Young's papers, we call a state stochastically stable if its long-term relative frequency of occurrence is bounded away from zero as the mutation rate decreases...

We here develop a model of pre-play communication that generalizes the cheap-talk approach by allowing players to have a lexicographic preference, second to the payoffs in the underlying game, for honesty. We formalize this by way of an honesty (or truth) correspondence between actions and...