Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
An introduction to genetic algorithms
An introduction to genetic algorithms
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
| Hi-index | 0.00 |
Competing populations of finite automata co-evolve in an evolutionary algorithm to play two player games. Populations endowed with greater complexity do better against their less complex opponents in a strictly competitive constant sum game. In contrast, complexity determines efficiency levels, but not relative earnings, in a Prisoner's Dilemma game; greater levels of complexity result in mutually higher earnings. With reporting noise, advantages to complexity are lost and efficiency levels are reduced as relatively less complex strategies are selected.