 Memory-based prisoner’s dilemma game with conditional selection on networksWenxing Ye, Weiying Feng, Chen Lü and Suohai Fan Applied Mathematics and Computation, 2017, vol. 307, issue C, 31-37 Abstract: We investigated the memory-based prisoner’s dilemma game with conditional selection on networks. The proposed selection takes the historical information into account, which helps evaluate the recent performance in the history and select neighbors with strong attractiveness. Those neighbors who get more payoffs than average payoff in the memory length are considered in potential growth way. The simulation results shows that memory length M makes a dual impact on the spatial interaction. Defection is benefit from small M while cooperation is promoted by large M. Cooperator can resist the defector’s invasion with the increase of memory length M. Discussions for the average payoff and strategy distribution in the spatial game show the effect of the proposed mechanism with conditional selection. The findings may be helpful in understanding cooperative behavior in natural and social systems consisting of conditional selection based on the recent performance in the history. Keywords: Prisoner’s dilemma game; Cooperative behavior; Conditional selection; Memory length; Historical information; Recent performance (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:307:y:2017:i:c:p:31-37 DOI: 10.1016/j.amc.2017.02.035 Access Statistics for this article Applied Mathematics and Computation is currently edited by Theodore Simos More articles in Applied Mathematics and Computation from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.