This paper tries to connect the theory of genetic algorithm (GA) learning to evolutionary game theory. It is shown that economic learning via genetic algorithms can be described as a specific form of evolutionary game. It will be pointed out that GA learning results in a series of near Nash equilibria which during the learning process build up to finally reach a neighborhood of an evolutionarily stable state. In order to clarify this point, a concept of evolutionary stability of genetic populations will be developed. Thus, in a second part of the paper it becomes possible to explain both, the reasons for the specific dynamics of standard GA learning models and the different kind of dynamics of GA learning models, which use extensions to the standard GA.
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.
Find related papers by JEL classification: C63 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Computational Techniques C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search, Learning, and Information
Cited by: (explanations, 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.)