Qunatifying Complexity in the Minority Game
arXiv:cond-mat/0306612 · doi:10.1016/S0378-4371(03)00181-X
Abstract
A Lempel-Ziv complexity measure is introduced into the theory of a Minority Game (MG) 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 offers 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.
8 pages, 4 figures
Cited by in corpus (4)
- On the non-randomness of maximum Lempel Ziv complexity sequences of finite size
- Mixing Bandt-Pompe and Lempel-Ziv approaches: another way to analyze the complexity of continuous-states sequences
- Lempel-Ziv complexity analysis of one dimensional cellular automata
- Properties of maximum Lempel-Ziv complexity strings