Self-organized Boolean game on networks
Tao Zhou, Bing-Hong Wang, Pei-Ling Zhou, Chun-Xia Yang, Jun Liu
Abstract
A model of Boolean game with only one free parameter p that denotes the strength of herd behavior is proposed where each agent acts according to the information obtained from his neighbors in network and those in the minority are rewarded. The simulation results indicate that the dynamic of system is sensitive to network topology, where the network of larger degree variance, i.e. the system of greater information heterogeneity, leads to less system profit. The system can self-organize to a stable state and perform better than random choice game, although only the local information is available to the agents. In addition, in heterogeneity networks, the agents with more information gain more than those with less information for a wide extent of herd strength p.
Create a lesson
Related papers
Robust Golden Ratio universality as a consequence of a circulant symmetry
Luka Paljk, Johannes Schmidt, Vladislav Popkov
Replica Transition at Measurement-Altered Ising Criticality
Kabir Khanna, Sara Murciano, Romain Vasseur
Scalene Yang-Baxter triples realize all nearest-neighbour Hamiltonians with global additive symmetries
Pramod Padmanabhan, Somnath Maity, Akash Sinha et al.
Graph-theoretic framework for semi-Markov networks: transient and stationary occupation probabilities, hitting times and weak ergodicity breaking
Julian Voits
Spectral optimization of spherical lattices and applications to classical and quantum interacting spin systems
Jonas Völler, Grigorios Makris, Fabian Hassler et al.
Entropic-ordered superfluid
Isabella Zane, Andrew Lucas