The Evolution of Algorithmic Learning Rules: A Global Stability Result
This 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.
|Date of creation:||12 Oct 1995|
|Note:||Type of Document - LaTex/PostScript; prepared on EmTex; to print on PostScript; pages: 53 ; figures: included|
|Contact details of provider:|| Web page: http://econwpa.repec.org|
References listed on IDEAS
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.:
- Blume, Lawrence & Easley, David, 1992. "Evolution and market behavior," Journal of Economic Theory, Elsevier, vol. 58(1), pages 9-40, October.
- Megiddo, Nimrod, 1989. "On computable beliefs of rational machines," Games and Economic Behavior, Elsevier, vol. 1(2), pages 144-169, June.
When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpga:9510001. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (EconWPA)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.