Evolutionary minority game on complex networks

✍ Scribed by Lihui Shang; Xiao Fan Wang

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

✦ Synopsis

In this work we investigate the dynamics of networked evolutionary minority game (NEMG) wherein each agent is allowed to evolve its strategy according to the information obtained from its neighbors in the network. We investigate four kinds of networks, including star network, regular network, random network and scale-free network. Simulation results indicate that the dynamics of the system depends crucially on the structure of the underlying network. The strategy distribution in a star network is sensitive to the precise value of the mutation magnitude L, in contrast to the strategy distribution in regular, random and scale-free networks, which is easily affected by the value of the prize-to-fine ratio R. Under a simple evolutionary scheme, the networked system with suitable parameters evolves to a high level of global coordination among its agents. In particular, the performance of the system is correlated to the clustering property of the network, where larger clustering coefficient leads to better performance.