Evolutionary Dynamics in Complex Networks of Competing Boolean Agents

Physics – Condensed Matter – Other Condensed Matter

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages, 6 figures

Scientific paper

We investigate the dynamics of network minority games on Kauffman's NK networks (Kauffman nets), growing directed networks (GDNets), as well as growing directed networks with a small fraction of link reversals (GDRNets). We show that the dynamics and the associated phase structure of the game depend crucially on the structure of the underlying network. The dynamics on GDNets is very stable for all values of the connection number $K$, in contrast to the dynamics on Kauffman's NK networks, which becomes chaotic when $K>K_c=2$. The dynamics of GDRNets, on the other hand, is near critical. Under a simple evolutionary scheme, the network system with a "near" critical dynamics evolves to a high level of global coordination among its agents. In particular, the performance of the system is close to the optimum for the GDRNets; this suggests that criticality leads to the best performance. For Kauffman nets with $K>3$, the evolutionary scheme has no effect on the dynamics (it remains chaotic) and the performance of the MG resembles that of a random choice game (RCG).

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Evolutionary Dynamics in Complex Networks of Competing Boolean Agents does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Evolutionary Dynamics in Complex Networks of Competing Boolean Agents, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Evolutionary Dynamics in Complex Networks of Competing Boolean Agents will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-353103

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.