Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · nlin/0309033

The Interactive Minority Game: a Web-based investigation of human market interactions

Paolo Laureti·Peter Ruch·Joseph Wakeling·Yi-Cheng Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

The unprecedented access offered by the World Wide Web brings with it the potential to gather huge amounts of data on human activities. Here we exploit this by using a toy model of financial markets, the Minority Game (MG), to investigate human speculative trading behaviour and information capacity. Hundreds of individuals have played a total of tens of thousands of game turns against computer-controlled agents in the Web-based_Interactive Minority Game_. The analytical understanding of the MG permits fine-tuning of the market situations encountered, allowing for investigation of human behaviour in a variety of controlled environments. In particular, our results indicate a transition in players' decision-making, as the markets become more difficult, between deductive behaviour making use of short-term trends in the market, and highly repetitive behaviour that ignores entirely the market history, yet outperforms random decision-making. PACS: 02.50.Le; 89.65.Gh; 89.70.+c Keywords: Decision theory and game theory; Economics and financial markets; Information theory

Explore related subjects

nlin.AOcond-mat.stat-mechcs.HCphysics.soc-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paolo Laureti, Peter Ruch, Joseph Wakeling, Yi-Cheng Zhang. 2003-11-05. The Interactive Minority Game: a Web-based investigation of human market interactions. https://doi.org/10.1016/j.physa.2003.07.002

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Self-Organization to the Edge of Ergodicity Breaking in a Complex Adaptive System

Self-organized criticality is widely invoked for collective behavior, yet its role in objective-driven, heterogeneous adaptive systems is unclear. We introduce {\tt EvoSK}: agents learn on a Sherrington--Kirkpatrick landscape while the least fit are replaced. It self-organizes to the edge of ergodicity breaking, with scale-free avalanches ($τ\approx -1.5$) and rewards beating any tuned non-evolutionary regime. Its cascade's branching ratio is the spectral radius of the learning dynamics' Jacobian, making critical branching and ergodicity breaking one marginal-stability condition fixing the exponent. The attraction to criticality follows from the selection--mutation balance: subcritical cascades decay too fast to dislodge frozen agents, supercritical cascades shield them from selection; only the critical power-law tail supplies the polynomial rate the balance requires.

nlin.AO↗
arXiv2026

When higher-order interactions enhance synchronization: the case of the Kuramoto model

Synchronization is a fundamental phenomenon in complex systems, observed across a wide range of natural and engineered contexts. The Kuramoto model provides a foundational framework for understanding synchronization among coupled oscillators, traditionally assuming pairwise interactions. However, many real-world systems exhibit group and many-body interactions, which can be effectively modeled through hypergraphs. Here we show that the effect of such higher-order interactions on synchronization is non-monotonic. Through a numerical study of higher-order Kuramoto models on random hypergraphs and on globally coupled systems, we find that the degree of synchronization reached from incoherent initial conditions is maximized at a small but nonzero higher-order coupling strength: weak higher-order interactions enhance synchronization when added to pairwise ones, whereas strong ones work against it, in line with earlier reports of reduced basins and of cluster states. We further show, through a cost-constrained allocation analysis, that under a constrained budget for interactions a mixed allocation of pairwise and higher-order couplings consistently achieves higher synchronization than relying on either type alone. These findings clarify the role of higher-order interactions in shaping collective dynamics and point to design principles for optimizing synchronization in complex systems.

nlin.AO↗
arXiv2026

Dynamics-preserving network reductions for ride-pooling paths

Reducing the complexity of ride-pooling paths is a central challenge in systems with distributed demand. Here we show that such dynamics admit an exact coarse-grained representation: for a broad class of routing algorithms whose decisions depend only on path lengths, the full network can be reduced to an effective network of active nodes weighted by shortest-path distances without altering the resulting trajectories, up to stochastic degeneracy breaking. The reduction therefore defines an equivalence class of network representations generating identical path dynamics. We further demonstrate that for globally optimizing dispatchers this equivalence is systematically violated through degeneracy amplification, yet remains quantitatively accurate beyond the exactly solvable regime. Our results identify when spatial structure can be integrated out without loss of dynamical fidelity, providing a general framework for the analysis of interacting path processes.

nlin.AO↗