Saez-Marti and Weibull [4] investigate the consequences of letting some agents play a myopic best reply to the myopic best reply in Young's [8] bargaining model. This is how they introduce cleverness of players. We analyze such clever agents in general finite two-player games. We show that...

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

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

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

Stochastic learning models provide sharp predictions about equilibrium selection when the noise level of the learning process is taken to zero.  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...

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