Algorithmic Complexity in Minority Game

Simple item page
dc.creatorCorona, Ricardo Mansilla
dc.date1999-06-01
dc.date.accessioned2026-07-25T16:20:53Z
dc.descriptionIn this paper we introduce a new approach for the study of the complex behavior of Minority Game using the tools of algorithmic complexity, physical entropy and information theory. We show that physical complexity and mutual information function strongly depend on memory size of the agents and yields more information about the complex features of the stream of binary outcomes of the game than volatility itself.
dc.description12 pages, 6 figures included
dc.identifierhttps://arxiv.org/abs/cond-mat/9906017
dc.identifierhttp://arxiv.org/abs/cond-mat/9906017
dc.identifier.urihttps://dspace.dare.co.zw/handle/123456789/40558
dc.subjectStatistical Mechanics
dc.subjectAdaptation and Self-Organizing Systems
dc.subjectChaotic Dynamics
dc.subjectComputational Complexity
dc.titleAlgorithmic Complexity in Minority Game
dc.typetext

Files

Collections

arXiv