Quantifying complexity in the minority game

DOI10.1016/S0378-4371(03)00181-XzbMath1049.91017arXivcond-mat/0306612OpenAlexW2048151869WikidataQ58472664 ScholiaQ58472664MaRDI QIDQ1394625

Zoran Mihailović, Milan Rajković

Publication date: 23 June 2003

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0306612

zbMATH Keywords

volatilitybinary outcome stringLempel-Ziv complexity measure

Mathematics Subject Classification ID

Stochastic games, stochastic differential games (91A15)

Related Items (3)

Dynamics characterization of modified Gross-Pitaevskii equation ⋮ Lempel-Ziv complexity analysis of one dimensional cellular automata ⋮ On the non-randomness of maximum Lempel Ziv complexity sequences of finite size

Cites Work

• Coding theorems for individual sequences
• On the Complexity of Finite Sequences
• On the Length of Programs for Computing Finite Binary Sequences

This page was built for publication: Quantifying complexity in the minority game