Cooperation is an effective manner to enable different elements of complex networks to work well. In this work, we propose a coevolution mechanism of learning willingness in the network population: an agent will be more likely to imitate a given neighbor’s strategy if her payoff is not less than the average performance of all her neighbors. Interestingly, increase of learning willingness will greatly promote cooperation even under the environment of extremely beneficial temptation to defectors. Through a microscopic analysis, it is unveiled that cooperators are protected due to the appearance of large-size clusters. Pair approximation theory also validates all these findings. Such an adaptive mechanism thus provides a feasible solution to relieve social dilemmas and will inspire further studies.
Skip Nav Destination
Article navigation
November 2019
Research Article|
November 13 2019
Adaptive willingness resolves social dilemma in network populations
Special Collection:
Focus Issue: Complex Network Approaches to Cyber-Physical Systems
Peican Zhu;
Peican Zhu
a)
1
School of Computer Science and Engineering, Northwestern Polytechnical University (NWPU)
, Xi’an, Shaanxi 710072, China
Search for other works by this author on:
Zhao Song
;
Zhao Song
a)
2
School of Mechanical Engineering, NWPU
, Xi’an, Shaanxi 710072, China
3
Center for OPTical IMagery Analysis and Learning (OPTIMAL), NWPU
, Xi’an, Shaanxi 710072, China
Search for other works by this author on:
Hao Guo;
Hao Guo
a)
2
School of Mechanical Engineering, NWPU
, Xi’an, Shaanxi 710072, China
3
Center for OPTical IMagery Analysis and Learning (OPTIMAL), NWPU
, Xi’an, Shaanxi 710072, China
Search for other works by this author on:
Zhen Wang;
Zhen Wang
2
School of Mechanical Engineering, NWPU
, Xi’an, Shaanxi 710072, China
3
Center for OPTical IMagery Analysis and Learning (OPTIMAL), NWPU
, Xi’an, Shaanxi 710072, China
Search for other works by this author on:
Tianyun Zhao
Tianyun Zhao
b)
4
School of Automation, NWPU
, Xi’an, Shaanxi 710072, China
Search for other works by this author on:
a)
Contributions: P. Zhu, Z. Song, and H. Guo contributed equally to this work.
b)
Author to whom correspondence should be addressed: [email protected]
Note: The paper is part of the Focus Issue, “Complex Network Approaches to Cyber-Physical Systems.”
Chaos 29, 113114 (2019)
Article history
Received:
March 23 2019
Accepted:
October 15 2019
Citation
Peican Zhu, Zhao Song, Hao Guo, Zhen Wang, Tianyun Zhao; Adaptive willingness resolves social dilemma in network populations. Chaos 1 November 2019; 29 (11): 113114. https://doi.org/10.1063/1.5093046
Download citation file:
Pay-Per-View Access
$40.00
Sign In
You could not be signed in. Please check your credentials and make sure you have an active account and try again.
Citing articles via
Ordinal Poincaré sections: Reconstructing the first return map from an ordinal segmentation of time series
Zahra Shahriari, Shannon D. Algar, et al.
Generalized synchronization in the presence of dynamical noise and its detection via recurrent neural networks
José M. Amigó, Roberto Dale, et al.
Tipping detection using climate networks
Laure Moinat, Jérôme Kasparian, et al.
Related Content
The expansion of neighborhood and pattern formation on spatial prisoner's dilemma
Chaos (April 2015)
Deterrence through punishment can resolve collective risk dilemmas in carbon emission games
Chaos (April 2023)
Memory and target payoff enhance cooperation in evolutionary social dilemmas
Chaos (August 2024)
Effects of value-driven social learning on cooperation in the prisoner’s dilemma games
Chaos (December 2024)