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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Length: 53 pages Date of creation: 12 Oct 1995 Date of revision: Handle: RePEc:wpa:wuwpga:9510001
Note: Type of Document - LaTex/PostScript; prepared on EmTex; to print on PostScript; pages: 53 ; figures: included Contact details of provider: Web page: http://129.3.20.41
For technical questions regarding this item, or to correct its listing, contact: (EconWPA).
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.: