Scale-free networks may not necessarily witness cooperation
Deep Nath, Saptarshi Sinha, Soumen Roy

TL;DR
This paper challenges the common belief that scale-free networks inherently promote cooperation, showing that similar degree distributions can lead to diverse cooperative behaviors depending on other network features.
Contribution
It demonstrates that degree distribution alone does not determine cooperation levels, highlighting the roles of network structure, clustering, and assortativity.
Findings
Degree sequence alone does not guarantee cooperation.
Network features like clustering influence cooperative behavior.
Hubs are not always crucial for maintaining cooperation.
Abstract
Networks with a scale-free degree distribution are widely thought to promote cooperation in various games. Herein, by studying the well-known prisoner's dilemma game, we demonstrate that this need not necessarily be true. For the very same degree sequence and degree distribution, we present a variety of possible behaviour. We reassess the perceived importance of hubs in a network towards the maintenance of cooperation. We also reevaluate the dependence of cooperation on network clustering and assortativity.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
