Adaptive willingness resolves social dilemma in network populations.

Clicks: 346
ID: 69690
2019
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #21 of 45 articles by views in chaos (woodbury, ny)

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
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.
Reference Key
zhu2019adaptivechaos Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Zhu, Peican;Song, Zhao;Guo, Hao;Wang, Zhen;Zhao, Tianyun;
Journal chaos (woodbury, ny)
Year 2019
DOI
10.1063/1.5093046
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.