arXiv · 1805.03849
On Arbitrarily Long Periodic Orbits of Evolutionary Games on Graphs
Abstract
A periodic behavior is a well observed phenomena in biological and economical systems. We show that evolutionary games on graphs with imitation dynamics can display periodic behavior for an arbitrary choice of game theoretical parameters describing social-dilemma games. We construct graphs and corresponding initial conditions whose trajectories are periodic with an arbitrary minimal period length. We also examine a periodic behavior of evolutionary games on graphs with the underlying graph being an acyclic (tree) graph. Astonishingly, even this acyclic structure allows for arbitrary long periodic behavior.
Explore related subjects
Keep this discovery
Jeremias Epperlein, Vladimír Švígler. 2018-05-10. On Arbitrarily Long Periodic Orbits of Evolutionary Games on Graphs. https://arxiv.org/abs/1805.03849
Cite the original work for its findings. Save a collection to share your selection of sources.