Learning of equilibria by a population with minimal information

Abstract In an evolutionary game context, we consider a population of players endlessly repeating a game, each player selecting a strategy at each time point to play against the rest of the population. Roughly stated, a given player switches strategy at random intervals according to two rules, 1. (i) The probability of switching over a short time interval is proportional to the gap between the player's current payoff and the highest payoff currently possible, 2. (ii) When a player does switch, she chooses a new strategy at random, with equal probabilities, among all other strategies. Thus, in contrast to most evolutionary game models, adaptation in this model is neither a best response nor an imitative response. The simple switching rules are meant to characterize a minimally informed and minimally calculating population. The main result is that the dynamics of the model will, for a sizable class of payoff structures, find a Nash equilibrium when best reply dynamics would not.

[1]  H. Young,et al.  The Evolution of Conventions , 1993 .

[2]  John Conlisk Adaptive tactics in games: Further solutions to the Crawford puzzle , 1993 .

[3]  Fernando Vega-Redondo Expectations, Drift, and Volatility in Evolutionary Games , 1995 .

[4]  John Conlisk,et al.  Interactive markov chains , 1976 .

[5]  R. Rob,et al.  Learning, Mutation, and Long Run Equilibria in Games , 1993 .

[6]  Hans Haller,et al.  Naive Bayesian learning in 2 x 2 matrix games , 1993 .

[7]  Larry Samuelson How to Tremble if you Must , 1991 .

[8]  J. Doob Stochastic processes , 1953 .

[9]  H. Simon,et al.  Models of Bounded Rationality: Empirically Grounded Economic Reason , 1997 .

[10]  John Conlisk,et al.  Product Quality in Markets Where Consumers are Imperfectly Informed , 1979 .

[11]  Josef Hofbauer,et al.  The theory of evolution and dynamical systems , 1988 .

[12]  L. Shapley SOME TOPICS IN TWO-PERSON GAMES , 1963 .

[13]  V. Crawford Learning the Optimal Strategy in a Zero-Sum Game , 1974 .

[14]  J. Weibull,et al.  Nash Equilibrium and Evolution by Imitation , 1994 .

[15]  John Conlisk,et al.  Adaptation in games: Two solutions to the Crawford puzzle , 1993 .

[16]  W. R. Buckland,et al.  Stochastic Models for Social Processes , 1967 .

[17]  Gregory K. Miller,et al.  Elements of Applied Stochastic Processes , 1972 .

[18]  John Conlisk,et al.  A stability theorem for an interactive Markov chain , 1978 .

[19]  H. Peyton Young,et al.  Stochastic Evolutionary Game Dynamics , 1990 .

[20]  John C. Harsanyi,et al.  Общая теория выбора равновесия в играх / A General Theory of Equilibrium Selection in Games , 1989 .