IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v13y2021i2p33-d488146.html

Cooperation in Social Dilemmas: A Group Game Model with Double-Layer Networks

Author

Listed:
  • Dongwei Guo

    (College of Computer Science and Technology, Jilin University, Changchun 130012, China)

  • Mengmeng Fu

    (College of Computer Science and Technology, Jilin University, Changchun 130012, China)

  • Hai Li

    (College of Computer Science and Technology, Jilin University, Changchun 130012, China)

Abstract

The combination of complex networks and game theory is one of the most suitable ways to describe the evolutionary laws of various complex systems. In order to explore the evolution of group cooperation in multiple social dilemmas, a model of a group game with a double-layer network is proposed here. Firstly, to simulate a multiplayer game under multiple identities, we combine a double-layer network and public goods game. Secondly, in order to make an individual’s strategy selection process more in line with a practical context, a new strategy learning method that incorporates individual attributes is designed here, referred to as a “public goods game with selection preferences” (PGG-SP), which makes strategic choices that are more humane and diversified. Finally, a co-evolution mechanism for strategies and topologies is introduced based on the double-layer network, which effectively explains the dynamic game process in real life. To verify the role of multiple double-layer networks with a PGG-SP, four types of double-layer networks are applied in this paper. In addition, the corresponding game results are compared between single-layer, double-layer, static, and dynamic networks. Accordingly, the results show that double-layer networks can facilitate cooperation in group games.

Suggested Citation

  • Dongwei Guo & Mengmeng Fu & Hai Li, 2021. "Cooperation in Social Dilemmas: A Group Game Model with Double-Layer Networks," Future Internet, MDPI, vol. 13(2), pages 1-27, January.
  • Handle: RePEc:gam:jftint:v:13:y:2021:i:2:p:33-:d:488146
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/13/2/33/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/13/2/33/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Duncan J. Watts & Steven H. Strogatz, 1998. "Collective dynamics of ‘small-world’ networks," Nature, Nature, vol. 393(6684), pages 440-442, June.
    2. M. E. J. Newman & D. J. Watts, 1999. "Renormalization Group Analysis of the Small-World Network Model," Working Papers 99-04-029, Santa Fe Institute.
    3. Büyükboyacı, Mürüvvet, 2014. "Risk attitudes and the stag-hunt game," Economics Letters, Elsevier, vol. 124(3), pages 323-325.
    4. Andrea Guazzini & Mirko Duradoni & Alessandro Lazzeri & Giorgio Gronchi, 2018. "Simulating the Cost of Cooperation: A Recipe for Collaborative Problem-Solving," Future Internet, MDPI, vol. 10(6), pages 1-17, June.
    5. Zhang, Shuhua & Zhang, Zhipeng & Wu, Yu’e & Yan, Ming & Xie, Yunya, 2018. "Tolerance-based punishment and cooperation in spatial public goods game," Chaos, Solitons & Fractals, Elsevier, vol. 110(C), pages 267-272.
    6. Galbiati, Roberto & Vertova, Pietro, 2008. "Obligations and cooperative behaviour in public good games," Games and Economic Behavior, Elsevier, vol. 64(1), pages 146-170, September.
    7. repec:spo:wpmain:info:hdl:2441/2k2jnd64aa9g19nja481vjohq3 is not listed on IDEAS
    8. Steven H. Strogatz, 2001. "Exploring complex networks," Nature, Nature, vol. 410(6825), pages 268-276, March.
    9. Sarkar, Bijan, 2018. "Moran-evolution of cooperation: From well-mixed to heterogeneous complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 497(C), pages 319-334.
    10. Zhang, Baojian & Cui, Zeguang & Yue, Xiaohang, 2019. "Cluster evolution in public goods game with fairness mechanism," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 532(C).
    11. Ranjay Gulati & Maxim Sytch & Adam Tatarynowicz, 2012. "The Rise and Fall of Small Worlds: Exploring the Dynamics of Social Structure," Organization Science, INFORMS, vol. 23(2), pages 449-471, April.
    12. Li, Yixiao & Shen, Bin, 2013. "The coevolution of partner switching and strategy updating in non-excludable public goods game," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(20), pages 4956-4965.
    13. Quan, Ji & Yang, Wenjun & Li, Xia & Wang, Xianjia & Yang, Jian-Bo, 2020. "Social exclusion with dynamic cost on the evolution of cooperation in spatial public goods games," Applied Mathematics and Computation, Elsevier, vol. 372(C).
    14. Ernst Fehr & Urs Fischbacher, 2003. "The nature of human altruism," Nature, Nature, vol. 425(6960), pages 785-791, October.
    15. Xuli Rao & Jiaxu Zhao & Zhide Chen & Feng Lin, 2019. "Substitute Seed Nodes Mining Algorithms for Influence Maximization in Multi-Social Networks," Future Internet, MDPI, vol. 11(5), pages 1-13, May.
    16. Wang, Chenxu & Wang, Gaoshuai & Luo, Xiapu & Li, Hui, 2019. "Modeling rumor propagation and mitigation across multiple social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 535(C).
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Marialisa Scatá & Barbara Attanasio & Aurelio La Corte, 2021. "Cognitive Profiling of Nodes in 6G through Multiplex Social Network and Evolutionary Collective Dynamics," Future Internet, MDPI, vol. 13(5), pages 1-17, May.
    2. Xie, Yunya & Li, Jianbiao & Zhang, Yankun & Wang, Yue, 2025. "Ephemeral connections, persistent effects: Cooperation dynamics in temporal networks with historical interactions," Chaos, Solitons & Fractals, Elsevier, vol. 199(P3).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gancio, Juan & Rubido, Nicolás, 2022. "Critical parameters of the synchronisation's stability for coupled maps in regular graphs," Chaos, Solitons & Fractals, Elsevier, vol. 158(C).
    2. Liu, Zhifeng & Wang, Chenlin & Yang, Jinqing, 2025. "The effects of scientific collaboration network structures on impact and innovation: A perspective from project teams," Journal of Informetrics, Elsevier, vol. 19(1).
    3. Bingyu Zhu & Tianchen Zhu & Jianxi Gao & Shlomo Havlin & Daqing Li, 2026. "Design of robust networks via reinforcement learning prompts the emergence of multi-backbones," Nature Communications, Nature, vol. 17(1), pages 1-14, December.
    4. Yan Yan & Jiancheng Guan, 2018. "How multiple networks help in creating knowledge: evidence from alternative energy patents," Scientometrics, Springer;Akadémiai Kiadó, vol. 115(1), pages 51-77, April.
    5. Danhao Zhu & Dongbo Wang & Saeed-Ul Hassan & Peter Haddawy, 2013. "Small-world phenomenon of keywords network based on complex network," Scientometrics, Springer;Akadémiai Kiadó, vol. 97(2), pages 435-442, November.
    6. Milena Oehlers & Benjamin Fabian, 2021. "Graph Metrics for Network Robustness—A Survey," Mathematics, MDPI, vol. 9(8), pages 1-48, April.
    7. Zhan, Choujun & Tse, Chi K. & Small, Michael, 2016. "A general stochastic model for studying time evolution of transition networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 464(C), pages 198-210.
    8. Xinsong Yang & Shuang Ai & Tingting Su & Ancheng Chang, 2013. "Synchronization of General Complex Networks with Hybrid Couplings and Unknown Perturbations," Abstract and Applied Analysis, John Wiley & Sons, vol. 2013(1).
    9. Quan, Ji & Pu, Zhenjuan & Wang, Xianjia, 2021. "Comparison of social exclusion and punishment in promoting cooperation: Who should play the leading role?," Chaos, Solitons & Fractals, Elsevier, vol. 151(C).
    10. Quan, Ji & Yu, Junyu & Li, Xia & Wang, Xianjia, 2023. "Conditional switching between social excluders and loners promotes cooperation in spatial public goods game," Chaos, Solitons & Fractals, Elsevier, vol. 169(C).
    11. Sayari, Elaheh & Seifert, Evandro G. & Cruziniani, Fátima E. & Gabrick, Enrique C. & Iarosz, Kelly C. & Szezech, José D. & Baptista, Murilo S. & Caldas, Iberê L. & Batista, Antonio M., 2023. "Structural connectivity modifications in the brain of selected patients with tumour after its removal by surgery (a case study)," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 623(C).
    12. Zhang, Jianhua & Xu, Xiaoming & Hong, Liu & Wang, Shuliang & Fei, Qi, 2011. "Networked analysis of the Shanghai subway network, in China," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(23), pages 4562-4570.
    13. Mario V. Tomasello & Mauro Napoletano & Antonios Garas & Frank Schweitzer, 2017. "The rise and fall of R&D networks," Industrial and Corporate Change, Oxford University Press and the Associazione ICC, vol. 26(4), pages 617-646.
    14. Khalilzadeh, Jalayer, 2022. "It is a small world, or is it? A look into two decades of tourism system," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 606(C).
    15. Ye Deng & Jun Wu & Xin Lu & Petter Holme & Daqing Li & Zengru Di & Guanrong Chen & Jürgen Kurths, 2026. "Community structure unveils the path multiplicity in complex networks," Nature Communications, Nature, vol. 17(1), pages 1-11, December.
    16. Nie, Tingyuan & Fan, Bo & Wang, Zhenhao, 2022. "Complexity and robustness of weighted circuit network of placement," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 598(C).
    17. Reppas, Andreas I. & Spiliotis, Konstantinos & Siettos, Constantinos I., 2015. "Tuning the average path length of complex networks and its influence to the emergent dynamics of the majority-rule model," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 109(C), pages 186-196.
    18. Yandong Li & Francesco Monticone, 2025. "The spatial complexity of optical computing: toward space-efficient design," Nature Communications, Nature, vol. 16(1), pages 1-11, December.
    19. Yang, Yong & Tu, Lilan & Li, Kuanyang & Guo, Tianjiao, 2019. "Optimized inter-structure for enhancing the synchronizability of interdependent networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 521(C), pages 310-318.
    20. Zhang, Jianhua & Wang, Shuliang & Wang, Xiaoyuan, 2018. "Comparison analysis on vulnerability of metro networks based on complex network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 72-78.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:gam:jftint:v:13:y:2021:i:2:p:33-:d:488146. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager The email address of this maintainer does not seem to be valid anymore. Please ask MDPI Indexing Manager to update the entry or send us the correct address (email available below). General contact details of provider: https://www.mdpi.com .

    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.