On Two Types of GA-Learning
We distinguish two types of learning with a Genetic Algorithm. A population learning Genetic Algorithm (or pure GA), and an individual learning Genetic Algorithm (basically a GA combined with a Classifier System ). The difference between these two types of GA is often neglected, but we show that for a broad class of problems this difference is essential as it may lead to widely differing performances. The underlying cause for this is a so called spite effect.
KeywordsNash Equilibrium Output Level Inverse Demand Function Walrasian Equilibrium Output Rule
Unable to display preview. Download preview PDF.
- 1.Axelrod R. (1987) The Evolution of Strategies in the Iterated Prisoner’s Dilemma. In: Davis L. (Ed.), Genetic Algorithms and Simulated Annealing. London: PitmanGoogle Scholar
- 2.Fouraker L. E., Siegel S. (1963) Bargaining Behavior. New York: McGraw-HillGoogle Scholar
- 4.Levine D. K. (1998) Modeling Altruism and Spitefulness in Experiments. Review of Economic Dynamics 1 Google Scholar
- 6.Palomino F. (1995) On the Survival of Strictly Dominated Strategies in Large Populations. Institute for Economic Analysis WP 308.95. Universitat Autonoma de BarcelonaGoogle Scholar
- 7.Rhode P., Stegeman M. (1995) Evolution through Imitation (with Applications to Duopoly). Working Paper E95–43. Virginia Polytechnic Institute & State University, Department of EconomicsGoogle Scholar
- 10.Stanley E. A., Ashlock D., Tesfatsion L. (1994) Iterated Prisoner’s Dilemma with Choice and Refusal of Partners. In: Langton C. G. (Ed.) Artificial Life III. Redwood, CA: Addison-Wesley, 131–175Google Scholar