Evolutionary games on graphs and discrete dynamical systems

From MaRDI portal
Publication:5248191

DOI10.1080/10236198.2014.988618zbMATH Open1310.05141arXiv1411.4145OpenAlexW2105413421MaRDI QIDQ5248191FDOQ5248191


Authors: Jeremias Epperlein, S. Siegmund, Petr Stehlík Edit this on Wikidata


Publication date: 28 April 2015

Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)

Abstract: Evolutionary games on graphs play an important role in the study of evolution of cooperation in applied biology. Using rigorous mathematical concepts from a dynamical systems and graph theoretical point of view, we formalize the notions of attractor, update rules and update orders. We prove results on attractors for different utility functions and update orders. For complete graphs we characterize attractors for synchronous and sequential update rules. In other cases (for k-regular graphs or for different update orders) we provide sufficient conditions for attractivity of full cooperation and full defection. We construct examples to show that these conditions are not necessary. Finally, by formulating a list of open questions we emphasize the advantages of our rigorous approach.


Full work available at URL: https://arxiv.org/abs/1411.4145




Recommendations




Cites Work


Cited In (7)





This page was built for publication: Evolutionary games on graphs and discrete dynamical systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248191)