Networking effects on evolutionary snowdrift game in networks with fixed degrees

Physica A: Statistical Mechanics and its Applications

Volumn 385, Issue 2, 2007, Pages 773-780

  Xu, C ^a,b   Hui, P M ^b   Zheng, Da Fang ^c  

^a SOOCHOW UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c ZHEJIANG UNIVERSITY   (China)

Author keywords

Clustering coefficient; Networking effect; Sharing coefficient; Snowdrift game

Indexed keywords

APPROXIMATION THEORY; ELECTRIC NETWORK ANALYSIS; EVOLUTIONARY ALGORITHMS; INFORMATION THEORY; NUMERICAL METHODS; SENSITIVITY ANALYSIS;

CLUSTERING COEFFICIENT; SHARING COEFFICIENT; SNOWDRIFT GAME;

GAME THEORY;

EID: 34548712354     PISSN: 03784371     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.physa.2007.07.038     Document Type: Article

References (19)

1. Hauert C., and Doebeli M. Nature (London) 428 (2004) 643
2. Nowak M.A., Sasaki A., Taylor C., and Fudenberg D. Nature London 428 (2004) 646
3. Abramson G., and Kuperman M. Phys. Rev. E 63 (2001) 030901
4. Anghel M., Toroczkai Z., Bassler K.E., and Korniss G. Phys. Rev. Lett. 92 (2004) 058701
5. Hofbauer J., and Sigmund K. Evolutionary Games and Population Dynamics (1998), Cambridge University Press, Cambridge UK
6. Santos F.C., and Packeco J.M. Phys. Rev. Lett. 95 (2005) 098104
7. Traulsen A., Nowak M.A., and Packeco J.M. Phys. Rev. E 74 (2006) 011909
8. Sysi-Aho M., Saramäki J., Kertész J., and Kaski K. Eur. Phys. J. B 44 (2005) 129
9. Maynard Smith J., and Price G. Nature (London) 246 (1973) 15
10. Ohtsuki H., Hanert C., Lieberman E., and Nowak M.A. Nature (London) 441 (2006) 502
11. Milinski M., Luthi J.H., Eggler R., and Parker G.A. Proc. R. Soc. London Ser B 264 (1997) 831
12. Turner P.E., and Chao L. Nature London 398 (1999) 441
13. Zhong L.X., Zheng D.F., Zheng B., Xu C., and Hui P.M. Europhys. Lett. 76 (2006) 724
14. Maynard Smith J., and Szathmáry E. The Major Transitions in Evolution (1995), W.H. Freeman, Oxford, UK
15. Watts D.J., and Strogatz S.H. Nature London 393 (1998) 440
16. Watts D.J. Small Worlds: The Dynamics of Networks Between Order and Randomness (1999), Princeton, New Jersey
17. The sharing coefficient defined here is related, but not exactly equal to, the motif or the number of tetragons in the network.
18. For the asynchronous updating process in evolving the characters, there exists isolated D-nodes in an otherwise dominating C-nodes environment for small values of r. This is in constrast to the all-C population for small r obtained in a synchronous updating process.
19. Newman M.E.J., and Watts D.J. Phys. Rev. E 60 (1999) 7332