vix.ing · top · new · best · stats · spec

Algorithmic Complexity in Minority Game

1999/06/01 by Ricardo Mansilla Corona, Corona, Ricardo Mansilla
Computer Science · Decision Sciences · Physics and Astronomy · #Adaptation and Self-Organizing Systems (nlin.AO) #Chaotic Dynamics (nlin.CD) #Computability, Logic, AI Algorithms #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #Game Theory and Applications #Statistical Mechanics (cond-mat.stat-mech) #adap-org #chao-dyn #cond-mat.stat-mech #cs.CC #nlin.AO #nlin.CD

paper · pdf · doi:10.48550/arxiv.cond-mat/9906017

12 pages, 6 figures included

arxiv created 1999/06/01 · openalex publication_date 1999/06/01 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In 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.

Related