Dynamical reciprocity in interacting games: numerical results and mechanism analysis
Rizhou Liang Affiliation: School of Physics and Information Technology, Shaanxi Normal University, Xi’an 710062, People’s Republic of China Qinqin Wang Affiliation: School of Physics and Information Technology, Shaanxi Normal University, Xi’an 710062, People’s Republic of China Jiqiang Zhang Affiliation: School of Physics and Electronic-Electrical Engineering, Ningxia University, Yinchuan 750021, People’s Republic of China Affiliation: Beijing Advanced Innovation Center for Big Data and Brain Computing, Beihang University, Beijing 100191, People’s Republic of China Guozhong Zheng Affiliation: School of Physics and Information Technology, Shaanxi Normal University, Xi’an 710062, People’s Republic of China Lin Ma Affiliation: School of Physics and Information Technology, Shaanxi Normal University, Xi’an 710062, People’s Republic of China Li Chen Email address: Affiliation: School of Physics and Information Technology, Shaanxi Normal University, Xi’an 710062, People’s Republic of China Affiliation: Robert Koch-Institute, Nordufer 20, 13353 Berlin, Germany
Abstract
We study the evolution of two mutually interacting games with both pairwise games as well as the public goods game on different topologies. On 2d square lattices, we reveal that the game-game interaction can promote the cooperation prevalence in all cases, and the cooperation-defection phase transitions even become absent and fairly high cooperation is expected when the interaction goes to be very strong. A mean-field theory is developed that points out new dynamical routes arising therein. Detailed analysis shows indeed that there are rich categories of interactions in either individual or bulk scenario: invasion, neutral, and catalyzed types; their combination puts cooperators at a persistent advantage position, which boosts the cooperation. The robustness of the revealed reciprocity is strengthened by the studies of model variants, including asymmetrical or time-varying interactions, games of different types, games with time-scale separation, different updating rules etc. The structural complexities of the underlying population, such as Newman–Watts small world networks, Erdős–Rényi random networks, and Barabási–Albert networks, also do not alter the working of the dynamical rec
原文 arXiv:2102.00360;中英对照 + 大白话阅读 https://aha.fim.ai/paper/2102.00360v2