The Evolution of Algorithmic Learning Rules: A Global Stability Result
AbstractThis paper consider the dynamic evolution of algorithmic (recursive) learning rules in a normal form game. It is shown that the system - the population frequencies - is globally stable for any arbitrary N-player normal form game, if the evolutionary process is algorithmic and the `birth process' guarantees that an appropriate set of `smart' rules is present in the population. The result is independent of the nature of the evolutionary process; in particular it does not require the dynamics of the system to be `monotonic in payoffs' - those rules which do better in terms of payoffs grow faster than those who do less well. The paper also demonstrates that any limit point of the distribution of actions in such an evolutionary process corresponds to a Nash equilibrium (pure or mixed) of the underlying game if the dynamics of the system are continuous and monotonic in payoffs.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by EconWPA in its series Game Theory and Information with number 9510001.
Length: 53 pages
Date of creation: 12 Oct 1995
Date of revision:
Note: Type of Document - LaTex/PostScript; prepared on EmTex; to print on PostScript; pages: 53 ; figures: included
Contact details of provider:
Web page: http://22.214.171.124
Evolution; Learning Rules; Computability; Monotonic Dynamics;
Other versions of this item:
- Anderlini, L & Sabourian, H, 1996. "The Evolution of Algorithmic Learning Rules : A Global Stability Result," Economics Working Papers eco96/05, European University Institute.
- C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- C79 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Other
- D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search, Learning, and Information
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Megiddo, Nimrod, 1989. "On computable beliefs of rational machines," Games and Economic Behavior, Elsevier, vol. 1(2), pages 144-169, June.
- Blume, Lawrence & Easley, David, 1992. "Evolution and market behavior," Journal of Economic Theory, Elsevier, vol. 58(1), pages 9-40, October.
- Josephson, Jens, 2001.
"A Numerical Analysis of the Evolutionary Stability of Learning Rules,"
Working Paper Series in Economics and Finance
474, Stockholm School of Economics.
- Josephson, Jens, 2008. "A numerical analysis of the evolutionary stability of learning rules," Journal of Economic Dynamics and Control, Elsevier, vol. 32(5), pages 1569-1599, May.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (EconWPA).
If references are entirely missing, you can add them using this form.