IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v110y2018icp64-68.html
   My bibliography  Save this article

Prisoner’s dilemma game on reputation-based weighted network

Author

Listed:
  • Chen, Ya-Shan
  • Yang, Han-Xin
  • Guo, Wen-Zhong
  • Liu, Geng-Geng

Abstract

In this paper, we study the prisoner’s dilemma game on reputation-based weighted network. We define a player’s reputation as the frequency of cooperation in the past few time steps. The edge weight of a link is determined by the reputation of the two players at both ends. The payoff of an agent is multiplied by the value of edge weight. Compared with the unweighted network, the cooperation level is promoted strongly on the reputation-based weighted network. Moreover, we find that the cooperation level declines when the length of credit history becomes longer.

Suggested Citation

  • Chen, Ya-Shan & Yang, Han-Xin & Guo, Wen-Zhong & Liu, Geng-Geng, 2018. "Prisoner’s dilemma game on reputation-based weighted network," Chaos, Solitons & Fractals, Elsevier, vol. 110(C), pages 64-68.
    • Handle: RePEc:eee:chsofr:v:110:y:2018:i:c:p:64-68
    DOI: 10.1016/j.chaos.2018.03.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077918301036
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2018.03.007?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Deng, Lili & Wang, Hongsi & Wang, Rugen & Xu, Ronghua & Wang, Cheng, 2024. "The adaptive adjustment of node weights based on reputation and memory promotes fairness," Chaos, Solitons & Fractals, Elsevier, vol. 180(C).
    2. Quan, Ji & Zhang, Xiyue & Chen, Wenman & Tang, Caixia & Wang, Xianjia, 2024. "Reputation-dependent social learning on the evolution of cooperation in spatial public goods games," Applied Mathematics and Computation, Elsevier, vol. 475(C).
    3. Deng, Lili & Zhang, Xingxing & Wang, Cheng, 2021. "Coevolution of spatial ultimatum game and link weight promotes fairness," Applied Mathematics and Computation, Elsevier, vol. 392(C).
    4. Qian, Jia-Li & Zhou, Yin-Xiang & Hao, Qing-Yi, 2024. "The emergence of cooperative behavior based on random payoff and heterogeneity of concerning social image," Chaos, Solitons & Fractals, Elsevier, vol. 179(C).
    5. Zhang, Yao & Hao, Qing-Yi & Qian, Jia-Li & Wu, Chao-Yun & Guo, Ning & Ling, Xiang, 2024. "The cooperative evolution in the spatial prisoner's dilemma game with the local loyalty of two-strategy," Applied Mathematics and Computation, Elsevier, vol. 466(C).
    6. Hu, Qi & Jin, Tao & Jiang, Yulian & Liu, Xingwen, 2024. "Reputation incentives with public supervision promote cooperation in evolutionary games," Applied Mathematics and Computation, Elsevier, vol. 466(C).
    7. Quan, Ji & Tang, Caixia & Wang, Xianjia, 2021. "Reputation-based discount effect in imitation on the evolution of cooperation in spatial public goods games," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 563(C).
    8. Zhao, Yakun & Xiong, Tianyu & Zheng, Lei & Li, Yumeng & Chen, Xiaojie, 2020. "The effect of similarity on the evolution of fairness in the ultimatum game," Chaos, Solitons & Fractals, Elsevier, vol. 131(C).
    9. Quan, Ji & Tang, Caixia & Zhou, Yawen & Wang, Xianjia & Yang, Jian-Bo, 2020. "Reputation evaluation with tolerance and reputation-dependent imitation on cooperation in spatial public goods game," Chaos, Solitons & Fractals, Elsevier, vol. 131(C).
    10. Bi, Yan & Yang, Hui, 2023. "Based on reputation consistent strategy times promotes cooperation in spatial prisoner’s dilemma game," Applied Mathematics and Computation, Elsevier, vol. 444(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:chsofr:v:110:y:2018:i:c:p:64-68. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.