This paper considers 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.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.
Publisher Info
Paper provided by European University Institute in its series Economics Working Papers with number
eco96/05.
Length: 52 pages Date of creation: 1996 Date of revision: Handle: RePEc:eui:euiwps:eco96/05
Contact details of provider: Postal: Badia Fiesolana, Via dei Roccettini, 9, 50016 San Domenico di Fiesole (FI) Italy Phone: +39-055-4685.982 Fax: +39-055-4685.902 Web page: http://www.eui.eu/ECO/ More information through EDIRC
For technical questions regarding this item, or to correct its listing, contact: (Marcia Gastaldo).
Find related papers by JEL classification: 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
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.: