GRPO Does Not Close the Multi-Agent Coordination Gap

πŸ“… 2026-06-05
πŸ“ˆ Citations: 0
✨ Influential: 0
πŸ“„ PDF
πŸ€– AI Summary
This study investigates the limitations of large language models in coordinating among multiple agents sharing constrained resources, using the classic Dining Philosophers problem as a benchmark task. The authors introduce Group Relative Policy Optimization (GRPO) and employ Welch’s t-test alongside Hedges’ g effect size for rigorous evaluation. Results indicate that GRPO fails to yield statistically significant performance improvements, with some models converging to degenerate zero-action policies. The experiments reveal that the primary bottlenecks for open-weight models stem from reward design, checkpoint selection, and curriculum learning strategies, rather than computational constraints. Notably, Qwen3-14B exhibits markedly inferior performance, whereas Mistral-Small 24B achieves comparatively strong results under specific configurations.
πŸ“ Abstract
We measure how well current large language models coordinate as multiple agents sharing a common resource, using the dining philosophers problem as a clean test bed. Across 630 episodes spanning seven models and three philosopher counts, four frontier closed-source systems reach mean reward 0.45 to 0.87 and Mistral-Small 24B reaches 0.83 to 0.99, while Qwen3-14B reaches 0.13 to 0.35. We then ask whether group relative policy optimization (GRPO) on rollouts from the task itself can close the gap and find that it cannot: a Welch's t-test on per-episode reward at five philosophers gives p = 0.66 and a Hedges' g of -0.11, with no statistically significant change at ten or fifteen philosophers either. Two further observations qualify the result. The training reward of both 8B and 14B runs peaked at step nine and then declined, so the default saved checkpoint at step 15 is strictly worse than several earlier ones. The four-term reward we use admits a degenerate maximum at zero actions, which DeepSeek-R1-Distill-Qwen-7B and Mistral-Small 24B at five philosophers both inhabit, with mean reward 1.0 and 0.83 respectively at zero meals. The bottleneck for an open-weight 14B model on multi-agent coordination is not training compute but training methodology: reward shaping that does not collapse to a no-action maximum, checkpoint discipline that does not depend on the final step, and curriculum across problem scales.
Problem

Research questions and friction points this paper is trying to address.

multi-agent coordination
large language models
dining philosophers problem
reward shaping
training methodology
Innovation

Methods, ideas, or system contributions that make the work stand out.

multi-agent coordination
Group Relative Policy Optimization
reward shaping
checkpoint selection
curriculum learning
πŸ”Ž Similar Papers
No similar papers found.
N
Najmul Hasan
Department of Mathematics and Computer Science, University of North Carolina at Pembroke, Pembroke, NC, USA
P
Prashanth BusiReddyGari
Department of Mathematics and Computer Science, University of North Carolina at Pembroke, Pembroke, NC, USA