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
Quantifying complexity in the minority game
✍ Scribed by Milan Rajković; Zoran Mihailović
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 182 KB
- Volume
- 325
- Category
- Article
- ISSN
- 0378-4371
No coin nor oath required. For personal study only.
✦ Synopsis
A Lempel-Ziv complexity measure is introduced into the theory of a minority game in order to capture some features that volatility, one of the central quantities in this model of interacting agents, is not able to. Extracted solely from the binary string of outcomes of the game complexity o ers new and valuable information on collective behavior of players. Also, we show that an expression for volatility may be included in the analytical expression for complexity.
📜 SIMILAR VOLUMES
This paper proposes a new model of Incomplete Minority Game (IMG), which features a default hierarchy of rules. This model introduces random bits into players' individual strategies and is capable of applying the exception rules in the absence of the default one. Analysis of the numerical experiment