Generalized Hamiltonian Dynamics and Chaos in Evolutionary Games on Networks

DOI10.1016/J.PHYSA.2022.127281MaRDI QIDQ6341765arXivWikidataFDO

Authors Christopher Griffin, Justin Semonsen, Andrew Belmonte

Publication date 30 May 2020

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.PHYSA.2022.127281

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

arXiv classification

cs.GTmath.DSnlin.CD

Abstract: We study the network replicator equation and characterize its fixed points on arbitrary graph structures for $2imes2$ symmetric games. We show a relationship between the asymptotic behavior of the network replicator and the existence of an independent vertex set in the graph and also show that complex behavior cannot emerge in $2imes2$ games. This links a property of the dynamical system with a combinatorial graph property. We contrast this by showing that ordinary rock-paper-scissors (RPS) exhibits chaos on the 3-cycle and that on general graphs with $geq3$ vertices the network replicator with RPS is a generalized Hamiltonian system. This stands in stark contrast to the established fact that RPS does not exhibit chaos in the standard replicator dynamics or the bimatrix replicator dynamics, which is equivalent to the network replicator on a graph with one edge and two vertices ($K_2$).

This page was built for publication: Generalized Hamiltonian Dynamics and Chaos in Evolutionary Games on Networks

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