Skip to content
Preprint

The rise and evolution of a referential code in populations of bee-like agents

Aug 2026 · 0 citations · 41 references
Biology Computer Science

TL;DR

This work model the rise of the first of these codes and its evolutionary transition to the second in populations of bee-like agents and finds that direct pointing evolves readily when food is moderately hard to find by random search alone.

Abstract

Communication typically relies on a shared code, and any change to it must be coordinated between senders and receivers to avoid a breakdown of communication. The honeybee waggle dance illustrates this problem: species with horizontal combs point directly at a food source, while species with vertical combs cannot point directly and instead reference the dance to gravity, decoded against the position of the sun. We model the rise of the first of these codes and its evolutionary transition to the second in populations of bee-like agents, with selection acting at the level of colonies. In a horizontal-comb model, we find that direct pointing evolves readily when food is moderately hard to find by random search alone, whether because sites are few and large or many and small. Communication fails to evolve when food is too sparse to spark dances or so abundant that it is found without signaling. Adding an exogenous benefit for vertical combs, we then find that the transition to the gravity-referenced code is driven mainly by the magnitude of this benefit and by the mutation scale, with the coupling between sender and receiver mutations playing a further role when the mutation scale is low. Given a favorable confluence of these factors, the transition proceeds reliably and without a breakdown of communication. Outside that confluence it remains possible, though rarer, across a much wider range of settings.

View source

Similar papers

Open access Oct 2026

Patience is a virtue: How nature achieves group navigation with minimal cooperativity

Group navigation of a constrained environment can be difficult to achieve without jamming as the local density of the group increases. The ease with which insects and other cognitively simple organisms achieve this feat suggests that a distributed computing solution must be possible, wherein the complexities of the pro...

Anne M. Mayo, C. Carrigee, Audrey B. Harrison et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Tapes Together Strong: The Co-evolution of Computation and Cooperation

Autopoietic Game Theory is introduced, a computational model where social interactions, replication mechanisms, and their associated computational costs are endogenous and simultaneously co-evolving and can incorporate exogenous pressures.

Kunal Jha, F. Cicala, B. A. Y. Arcas et al. · 0 citations
#machine learning Preprint Sep 2026

Theory of Scene: Breaking the Symmetry Trap in Multi-Agent LLM Coordination

Tory of Scene (ToS), a training-free reasoning schema in which each agent reads its public role, the only difference between the agents, and the task context they all observe, is proposed, which outperforms all six baselines on every benchmark, and each baseline falls far behind it in at least one setting.

Liang-Qi Yuan, Wen-Zhi Fang, Shi-Qiang Wang et al. · 0 citations
Open access Sep 2026

The co-evolution of costly markers and cooperation in social dilemmas

Costly cooperation and the evolution of costly signals are both difficult to reconcile with simple fitness maximization, yet both are common in biological and social systems. We study a model in which agents emit costly signals and condition their actions on the signals they observe. The signals are arbitrary, non-cost...

Mahdiah Abolhasani, Saman Moghimi-Araghi, Mohammad Salahshour · 0 citations
Preprint Sep 2026

The Computational Primitives of Adaptation

Research on adaptive systems has traditionally focused on behavior (what organisms do) and mechanism (how their machinery works). This paper focuses on a third level, computation, which considers what adaptive systems must compute to survive and reproduce. It is proposed that adaptation has its own computational struct...

J. W. Page · 0 citations
#machine learning Preprint Aug 2026

Emergent aggregation from collective foraging

This work lets reinforcement learning foragers, initially performing a random walk, optimize their dynamics from a purely individual reward for finding replenishable targets, while perceiving only their conspecifics and never the targets themselves.

G. Muñoz-Gil, Andrea López-Incera, Vide Ramsten et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.