The paper demonstrates that a minimal foraging swarm can approach the explore/exploit optimum of reinforcement learning without any learner or reward signal. Agents use heavy‑tailed Levy flights to explore, recruit neighbors via a threshold cascade on their proximity network, and disperse as patch crowds, creating a cycle that balances exploration and exploitation. The swarm attains the shape of the ideal‑free distribution (committed foragers track richness with slope 0.94) and reaches this allocation dynamically in about 150 steps, though it remains slightly exploitable and does not achieve the exact equilibrium.
arXiv:2608. 15372v1 Announce Type: new Abstract: We study generating game-theoretically optimized Courses of Action (COAs) for a Blue UAS swarm against an adaptive Red adversary in a communication-degraded environment, motivated by (but not derived from) a public U.
The paper introduces Market‑Based Post‑Training (MPT), a framework that jointly learns action policies and self‑orchestration in decentralized agent swarms. Agents bid for participation, and these bids determine who acts and how local training credit is assigned, allowing both individual capabilities and participation patterns to adapt together without a central coordinator. Experiments on embodied crafting, robot navigation, and deep research show that MPT outperforms monolithic post‑training and alternative coordination strategies, and that learned self‑orchestration improves scalability, robustness to agent dropout, and adaptation to related tasks.
arXiv:2607. 12861v1 Announce Type: cross Abstract: Multi-agent Reinforcement Learning (MARL) holds great potential for robot swarms, but the black-box nature of neural policies complicates strategic analysis, limiting multi-robot applications.
arXiv:2608.28046v1 Announce Type: cross Abstract: Collective behaviour in living systems is usually modelled as the outcome of a \emph{direct} social drive: agents are rewarded, or hard-wired, to ali...
arXiv:2609.34373v2 Announce Type: replace Abstract: Rate-limited multi-agent teams raise three questions the emergent-communication literature has answered only empirically: what an optimal message s...
Organizations often pool dispersed information into one ranking and then allow many agents to act on that shared view. In a discovery problem, this can improve beliefs while reducing coverage.
The paper studies a stationary decentralized Markov game where a focal agent experiences drifting rewards and dynamics due to learning peers, framing this as an agent‑centric continual reinforcement‑learning problem. It introduces the concept of an invariant core—maximal abstract patterns common to many successful trajectories—and proves a worst‑case conditioning theorem linking trajectory‑law drift to success coverage. The authors provide theoretical guarantees for survival horizon, first‑exit law, and regret, and validate their predictions with solvable models and empirical studies in continual control, cue‑MNIST, and Level‑Based Foraging.
The paper introduces Hierarchical Reinforcement and Collective Learning (HRCL), a framework that combines multi‑agent reinforcement learning (MARL) with decentralized coordination. HRCL uses MARL at a high level to generate strategic guidance that limits the decision space for low‑level agents, enabling efficient short‑term coordination while considering long‑term effects. Experiments on synthetic, energy‑management, and drone‑swarm scenarios demonstrate faster convergence and significant reductions in system‑wide and individual costs compared to standalone MARL.
arXiv:2608. 01425v1 Announce Type: cross Abstract: Training LLM-based multi-agent systems with multi-agent reinforcement learning is rapidly gaining traction, and a parallel line of work argues that such systems should be judged by their behavior, not only their reward.
The paper investigates whether evolutionary stability guarantees that learning agents can achieve cooperative outcomes in a multi‑agent setting. Using a three‑agent governance game, the authors compare the evolutionary basin of attraction with learning basins derived from independent Q‑learning, scaled Boltzmann exploration, and SA–EA BQL. They find that while the evolutionary basin covers the entire sampled grid, only ε‑greedy Q‑learning attains a substantial learning basin, whereas the other methods fail to sustain cooperation, highlighting a disconnect between population‑level stability and finite‑sample learning accessibility.
The paper proposes CANOPY, a minimalist reinforcement learning protocol that addresses two common pitfalls—signal starvation and policy drift—in outcome‑only RL for long‑horizon interactive tasks. By scaling same‑task exploration, keeping updates on‑policy, and anchoring updates with KL divergence, CANOPY enables a Qwen3‑14B agent to achieve top leaderboard results on the AppWorld coding benchmark without auxiliary supervision or elaborate scaffolding. The approach also improves performance on SWE‑bench for a Qwen3.5‑9B model.
arXiv:2607. 18045v1 Announce Type: new Abstract: Organizations often pool dispersed information into one ranking and then allow many agents to act on that shared view.