Networking effects on evolutionary snowdrift game in networks with fixed degrees

✍ Scribed by C. Xu; P.M. Hui; Da-Fang Zheng

• Publisher: Elsevier Science
• Year: 2007
• Tongue: English
• Weight: 302 KB
• Volume: 385
• Category: Article
• ISSN: 0378-4371
• DOI: 10.1016/j.physa.2007.07.038

✦ Synopsis

We study the effects of spatial structures other than the degree distribution on the extent of the emergence of cooperation in an evolutionary snowdrift game. By swapping the links in three different types of regular lattices with a fixed degree k, we study how the frequency of cooperator f C changes as the clustering coefficient (CC), which signifies how the nearest neighbors of a vertex are connected, and the sharing coefficient (SC), which signifies how the next-nearest neighbors of a vertex are shared by the nearest neighbors, are varied. For small k, a non-vanishing CC tends to suppress f C . A non-vanishing SC also leads to a suppressed f C for the networks studied. As the degree increases, the sensitivity of f C to the network properties is found to become increasingly weak. The result is discussed within the context of the ranking patterns of average payoffs as k changes. An approximation for f C , which is based on the idea of a finite fully connected network and gives results in good agreement with numerical results, is derived in the limit of large k.