Abstract
Unlike evolutionary dynamics, coevolutionary dynamics can exhibit a wide variety of complex regimes. This has been confirmed by numerical studies, e.g., in the context of evolutionary game theory (EGT) and population dynamics of simple two-strategy games with various types of replication and selection mechanisms. Using the framework of shadowing lemma, we study to what degree can such infinite population dynamics: 1) be reliably simulated on finite precision computers; and 2) be trusted to represent coevolutionary dynamics of possibly very large, but finite, populations. In a simple EGT setting of two-player symmetric games with two pure strategies and a polymorphic equilibrium, we prove that for (μ,λ), truncation, sequential tournament, best-of-group tournament, and linear ranking selections, the coevolutionary dynamics do not possess the shadowing property. In other words, infinite population simulations cannot be guaranteed to represent real trajectories or to be representative of coevolutionary dynamics of potentially very large, but finite, populations.
| Original language | English |
|---|---|
| Article number | 6449315 |
| Pages (from-to) | 155-164 |
| Number of pages | 10 |
| Journal | IEEE Transactions on Evolutionary Computation |
| Volume | 17 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2013 |
| Externally published | Yes |
Free Keywords
- Coevolutionary dynamics
- evolutionary game theory
- shadowing lemma
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Computational Theory and Mathematics
Fingerprint
Dive into the research topics of 'Complex coevolutionary dynamics - Structural stability and finite population effects'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver