Genetic algorithm learning and evolutionary games

Authors
Citation
T. Riechmann, Genetic algorithm learning and evolutionary games, J ECON DYN, 25(6-7), 2001, pp. 1019-1037
Citations number
34
Categorie Soggetti
Economics
Journal title
JOURNAL OF ECONOMIC DYNAMICS & CONTROL
ISSN journal
01651889 → ACNP
Volume
25
Issue
6-7
Year of publication
2001
Pages
1019 - 1037
Database
ISI
SICI code
0165-1889(200106/07)25:6-7<1019:GALAEG>2.0.ZU;2-X
Abstract
This paper links the theory of genetic algorithm (GA) learning to evolution ary game theory. It is shown that economic learning via genetic algorithms can be described as a specific form of an evolutionary game. It will be poi nted out that GA learning results in a series of near Nash equilibria which during the learning process build up to finally approach a neighborhood of an evolutionarily stable state. In order to characterize this kind of dyna mics, a concept of evolutionary superiority and evolutionary stability of g enetic populations is developed, which allows for a comprehensive analysis of the evolutionary dynamics of the standard GA learning processes. (C) 200 1 Elsevier Science B.V. All rights reserved.