arXiv · cond-mat/0306516
Crowd-Anticrowd Theory of Collective Dynamics in Competitive, Multi-Agent Populations and Networks
Abstract
We discuss a crowd-based theory for describing the collective behavior in a generic multi-agent population which is competing for a limited resource. These systems -- whose binary versions we refer to as B-A-R (Binary Agent Resource) collectives -- have a dynamical evolution which is determined by the aggregate action of the heterogeneous, adaptive agent population. Accounting for the strong correlations between agents' strategies, yields an accurate description of the system's dynamics in terms of a 'Crowd-Anticrowd' theory. This theory can incorporate the effects of an underlying network within the population. Most importantly, its applicability is not just limited to the El Farol Problem and the Minority Game. Indeed, the Crowd-Anticrowd theory offers a powerful approach to tackling the dynamical behavior of a wide class of agent-based Complex Systems, across a range of disciplines. With this in mind, the present working paper is written for a general multi-disciplinary audience within the Complex Systems community.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Neil F. Johnson, Pak Ming Hui. 2003-06-20. Crowd-Anticrowd Theory of Collective Dynamics in Competitive, Multi-Agent Populations and Networks. https://arxiv.org/abs/cond-mat/0306516
Cite the original work for its findings. Save a collection to share your selection of sources.