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 a dynamic model of assignment problems, small deviations suffice to move between stable outcomes. This result is used to obtain no-selection and almost-no-selection results under the stochastic stability concept for uniform and payoff-dependent errors. There is no-selection of partner or...