Abstract
The spatial evolutionary games have been studied abundantly in the past two decades. Recently, there is research showing that the emergence of cooperators on temporal networks varies from static networks. However, few research takes players’ interaction lifespans into account, which can be regarded as one of the individuals’ characteristics in real networks. In this paper, we introduce a network model based on the M/M/∞ queueing system and perform the weak prisoner’s dilemmas, where each new individual arrives at the network by Poisson process and has an exponential lifespan. In addition, we propose a neighborhood similarity inheritance mechanism to maintain the players’ interaction requirements and reduce the impact of leaving players to the network. We suggest that cooperators emerge in the aforementioned network model on weak prisoner’s dilemmas, and the inheritance mechanism brings more cooperators to the network, which helps to overcome social dilemmas. Besides, by analyzing the evolution process of the degree distribution and the mean clustering coefficient, it is shown that the inheritance mechanism guarantees the degree heterogeneity and higher mean clustering coefficients, which are shown to promote cooperative behaviors in previous studies.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.