β—ˆ OPENENV HACKATHON β€” APR 2026

TICKETMELT

MULTI-AGENT COORDINATION Β· SIMULTANEOUS RESOURCE CONTENTION Β· GRPO TRAINING

An OpenEnv-compliant RL environment that trains LLMs to break convergent reasoning β€” the documented failure mode where frontier models deadlock 95%+ of the time on simultaneous coordination tasks.

4
AGENTS
2
SERVERS
31
TESTS
4
REWARD COMPONENTS
β–Ά LIVE DEMO β—ˆ API ENDPOINT
↓
β—ˆ 01 / PROBLEM STATEMENT
Why LLMs Deadlock Under Pressure
β—ˆ DOCUMENTED FAILURE MODES IN FRONTIER MODELS β€” 2024–2026
95%
β—ˆ DEADLOCK RATE
DPBench (Feb 2026) showed frontier LLMs deadlock 95%+ on simultaneous coordination tasks. Adding communication channels made performance worse, not better.
0%
β—ˆ URGENCY ADAPTATION
NeurIPS 2024 Concordia: LLM agents fail when scenarios require detecting peers with different urgency levels. Critical peers are treated identically to low-priority ones.
4Γ—
β—ˆ SIMULTANEOUS COMMITMENT
4 agents commit simultaneously with no observation of others. Identical reasoning produces identical actions which collide. The symmetry is structural.
RL
β—ˆ FIX β€” GRPO
GRPO trains Qwen-2.5-3B-Instruct from binary reward signal alone. No demonstrations. The model learns asymmetric coordination strategies through reward shaping.
β—ˆ 02 / INTERACTIVE DEMO
Live Demo
β—ˆ NEURAL REWIRING Β· EPISODE REPLAY Β· LIVE ENVIRONMENT STATE
β—ˆ NEURAL DECISION WEIGHTS β€” LIVE
UAL-441 DAL-892 SWA-77 ⚠ PRIORITY AAL-213 PROD_A SERVER A PROD_B SERVER B A:85% B:15% A:80% B:20% A:75% B:25% A:82% B:18% AGENTS SERVERS
STEP 0 STEP 16 STEP: 0 / 16
81%
COLLISION RISK ↓
0.04
SYMMETRY SCORE ↓
0.169
R4 YIELD ↑
0.961
COLLISION RATE ↓
CONVERGENT DEADLOCK β€” all probability mass on PROD_A
Edge thickness = model's probability of choosing each server. Watch the symmetry break as GRPO trains.
β—ˆ SECTOR 7 APPROACH RADAR β€” ATC EPISODE REPLAY
β—ˆ SECTOR 7 APPROACH RADAR  Β·  READY
FLIGHT PROGRESS STRIPS
UAL-441
HOLD
β€”
DAL-892
HOLD
β€”
SWA-77 ⚠
HOLD
β€”
AAL-213
HOLD
β€”
RADIO COMMS
β€” awaiting episode start β€”
0
COLLISIONS
0
LANDED
β€”
OUTCOME

β—ˆ NOTE β€” The visualizations above represent the coordination problem conceptually. The Neural Rewiring graph shows how GRPO training shifts the model's server preference probabilities across 16 gradient steps. The ATC radar maps the same multi-agent environment to an air traffic control scenario. Both illustrate the core hackathon theme: using RL to train LLMs on simultaneous multi-agent coordination tasks.

β—ˆ LIVE ENVIRONMENT STATE
CHECKING…
β€” press FETCH STATE to query the running environment β€”
≑ UNTRAINED vs TRAINED
β—ˆ 20-EPISODE EVAL Β· SAME SEEDS

β—Ž UNTRAINED BASELINE

COLLISION RATE96.1%
WIN RATE80.0%
R4 YIELD TO CRITICAL0.169
R2 SITE UPTIME0.263

β—‰ TRAINED (16 GRPO STEPS)

COLLISION RATE89.8% (↓6.3%)
WIN RATE70.0%
R4 YIELD TO CRITICAL0.276 (+63%)
R2 SITE UPTIME0.287 (+9%)
β—ˆ 03 / TRAINING RESULTS
Results
β—ˆ 20-EPISODE EVAL Β· QWEN-2.5-3B-INSTRUCT Β· 16 GRPO GRADIENT STEPS
METRICBASELINETRAINEDDELTA
Win Rate0.8000.700-0.100
R1: Service Restored0.8600.745-0.115
R2: Site Uptime0.2630.287+0.025
R3: No Collision0.7670.767+0.000
R4: Yield to Critical0.1690.276+0.106
Collision Rate0.9610.898-0.063
With only 16 GRPO gradient steps, yield-to-critical improved +0.106 (+63%), site uptime improved, and collision rate dropped. Win rate dipped slightly β€” expected with only 16 steps. Component rewards tell the cleaner story.
β—ˆ BEFORE / AFTER β€” METRIC COMPARISON
β—ˆ GRPO TRAINING REWARD CURVE β€” 16 STEPS
β—ˆ 04 / REWARD ARCHITECTURE
Four Independent Components β€” Gaming One Doesn't Earn the Others
β—ˆ BINARY TO GRPO Β· CONTINUOUS IN LOGS
R1 Β· 0.5
SERVICE RESTORED
Primary signal. Must exceed 0.5 threshold. Never deployed = no credit. Cannot be gamed by MONITOR.
R2 Β· 0.3
SITE UPTIME
Group welfare. Fraction of team services restored. Prevents selfish strategies β€” ignoring peers costs R2.
R3 Β· 0.1
CLEAN DEPLOYS
Collision avoidance. Never deployed = 0.0, not neutral. Idle agents get no credit for avoiding collisions they never risked.
R4 Β· 0.1
YIELD TO CRITICAL
Urgency adaptation. Hardest signal. Shows social reasoning β€” did you yield when a peer had a tighter deadline?
β—ˆ BINARY GRPO REWARD FORMULA
reward = 1.0 if (r1 > 0.5 and 0.5Β·r1 + 0.3Β·r2 + 0.1Β·r3 + 0.1Β·r4 > 0.35) else 0.0
β—ˆ 05 / TRAINING CONFIGURATION
Training Configuration
β—ˆ QWEN-2.5-3B-INSTRUCT Β· GRPO Β· UNSLOTH Β· A100 40GB
MODEL & TRAINING
BASE MODELQwen-2.5-3B-Instruct
METHODGRPO (TRL + Unsloth)
LORA RANKr=16
LEARNING RATE5e-6
NUM GENERATIONS8 per prompt
TEMPERATURE0.9
MAX GRAD NORM0.1
GRADIENT STEPS16
KL (MAX)< 0.003
GPUNVIDIA A100 40GB
ENVIRONMENT
AGENTS4 engineers
SERVERS2 (PROD_A / PROD_B)
EPISODE LENGTHUp to 8 rounds
PEER STRATEGYMixed (70% DUMB / 30% DIVERSE)
COMMITMENTSimultaneous (blind)
COLLISION RULE2 on same server = both fail
URGENCY FLAGSYes (critical deadlines)
REWARD TYPEBinary (inline computed)
TESTS31 passing
OPENENVβœ“ compliant
RESOURCES
README.md STATE API HF REPO COLAB NOTEBOOK HF Blog Post Youtube Video