Self-organized Boolean game on networks

Zhou, Tao; Wang, Bing–Hong; Zhou, Pei-Ling; Yang, Changwei; Liu, Jun

doi:10.1103/physreve.72.046139

Cited by 63 publications

(100 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Numerical simulations show that the minority game displays a remarkably rich emergent collective behavior, which has been qualitatively understood to some extent by approximate schemes. Many extensions on the MG model have been developed, including strategy structure [4][5][6], strategy-selection [7,8], and payoff [9,10] function and strategy-evolution [11,12], agent-network-related [13][14][15][16] and so on.…”

Section: Introductionmentioning

confidence: 99%

Failsafe modes in incomplete minority game

Yao

Wan

Chen

2009

Physica A: Statistical Mechanics and its Applications

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

Failsafe modes in incomplete minority game

Yao

Wan

Chen

2009

Physica A: Statistical Mechanics and its Applications

View full text Add to dashboard Cite

“…Currently, the dynamics of WL algorithm and search for optimal schedule for updating γ in order to achieve fast convergence to the true density of states with small statistical errors are under intensive studies. [31][32][33][34][35] Alternative methods for calculating the density of states are the broad histogram 15 and the transition matrix Monte Carlo (TMMC) methods. 17 It can be shown that the broad histogram method may be considered as a particular case of infinite temperature TMMC method 17 (see further in the text).…”

Section: Introductionmentioning

confidence: 99%

Efficient combination of Wang–Landau and transition matrix Monte Carlo methods for protein simulations

Ghulghazaryan¹,

Hayryan²,

Hu³

2006

J Comput Chem

View full text Add to dashboard Cite

An efficient combination of the Wang-Landau and transition matrix Monte Carlo methods for protein and peptide simulations is described. At the initial stage of simulation the algorithm behaves like the Wang-Landau algorithm, allowing to sample the entire interval of energies, and at the later stages, it behaves like transition matrix Monte Carlo method and has significantly lower statistical errors. This combination allows to achieve fast convergence to the correct values of density of states. We propose that the violation of TTT identities may serve as a qualitative criterion to check the convergence of density of states. The simulation process can be parallelized by cutting the entire interval of simulation into subintervals. The violation of ergodicity in this case is discussed. We test the algorithm on a set of peptides of different lengths and observe good statistical convergent properties for the density of states. We believe that the method is of general nature and can be used for simulations of other systems with either discrete or continuous energy spectrum.

show abstract

“…The special case with m = 0.01 and β = 0 has been previously studied to show the effect of degree heterogeneity on the dynamical behaviors [39].…”

Section: Modelmentioning

confidence: 99%

Boolean game on scale-free networks

Zhou

et al. 2007

Physica A: Statistical Mechanics and its Applications

Self Cite

View full text Add to dashboard Cite

Inspired by the local minority game, we propose a network Boolean game and investigate its dynamical properties on scale-free networks. The system can self-organize to a stable state with better performance than random choice game, although only the local information is available to the agent. By introducing the heterogeneity of local interactions, we find the system has the best performance when each agent's interaction frequency is linear correlated with its information capacity. Generally, the agents with more information gain more than those with less information, while in the optimal case, each agent almost has the same average profit. In addition, we investigate the role of irrational factor and find an interesting symmetrical behavior.

show abstract

Self-organized Boolean game on networks

Cited by 63 publications

References 23 publications

Failsafe modes in incomplete minority game

Failsafe modes in incomplete minority game

Efficient combination of Wang–Landau and transition matrix Monte Carlo methods for protein simulations

Boolean game on scale-free networks

Contact Info

Product

Resources

About