SCARCEShared Compute ARena for Coding agEnts · Preprint 2026

Emergent Institutions in Long‑Horizon Multi‑Agent Coding Systems

TL;DR

Coding agents that must share one execution resource start building their own institutions: rules and commitments, grounded in reciprocity, reputation and precedent, that carry from one task to the next. Agents sometimes give up an immediate advantage to keep an earlier deal. Newer frontier models do this most. We also see exclusionary coalitions and rare divide-and-conquer tactics.

“A commitment that only holds when it’s free isn’t a commitment.”a worker, quoted in the paper
taxonomy categories
21
models
8
trajectories audited
1,500+
runs with full traces here
76
1

How a round works

In SCARCE, each worker rebuilds a program from its executable and docs (ProgramBench) under a private deadline and credit budget. Inspecting, compiling and testing all need the one shared sandbox, so workers negotiate for time on it, round after round.

Code alone

Every worker has its own task, deadline and budget. Budgets and deadlines stay private.

Share one sandbox

Nobody can run code without a time slot. Workers bid credits for slots and agree on an order.

Remember

After each task, workers write a reflection that carries into the next task. Institutions form across these tasks.

A real round GLM-5.3 · fixed bid · run 1 · round 1
1Declare public
1slot 1 · 120 s · bid 180
3slot 1 · 60 s · bid 250
4slot 1 · 120 s · bid 180

All three want slot 1. Worker 3 bids highest; workers 1 and 4 are tied.

2Message private, optional
3Ballot then 4 · run
1votes3→1→4✓
3votes3→1→4✓
4votes3→1→4✓
The scheduler grants the agreed order
W3W1 · 120 sW4 · 120 s
0 s300 s
Worker
One coding agent: a solver that writes code, plus a negotiator that bids for time.
Round
One negotiation for the sandbox: declare, message, ballot, run.
Take
One worker’s turn in a round: its declaration, messages and ballot. The judge labels each take, so “% of takes” is the share of worker turns showing a behavior.
Exchange
One pass of private messages and replies. A round can have several.
Subrun
One coding task. A run chains up to four (S1–S4), with each worker’s reflection carried between them.
Run IDs
A1 means setting A, run 1. Settings: A fixed bid, B revisable bid, C unequal budget, D random budget, E random deadline, F no memory. Other prefixes name the model, e.g. G52A1 is GLM-5.2.
2

Same auction, different playbooks

Percentage of rounds showing each behavior (Table 1 in the paper; a round can show several). Relational behavior appears only in recent frontier models; efficiency-tier models lean on scheduling conventions. Click a model to sort by it, or hover a behavior for its definition.

Relational: institutions tied to specific partners, through commitment, reputation or precedent. Non-relational: institutions that apply to everyone, like a cited rule. Non-institutional: tactics and conventions that build on what the environment provides, not rules the agents devise themselves.
3

What the deals sound like

Reciprocity · relational

“All three ballots converged on this 1→3→2 schedule in negotiation, and I committed to it in exchange for both 300-bidders’ next-round backing for my cmatrix build window.”

4

Pacts fade as bids rise

Four GLM-5.3 runs with fixed bids. The line shows how many relational behaviors (reciprocity, coalition formation, loyalty, reputation and so on) the judge found per worker in each round, on average. Only workers who asked for the sandbox take part in a round, so a round has 1 to 5 workers. Figure 11 plots the same quantity as a percentage. As bids escalate, relational behavior stops being dominant. Hover or tap a round to read it.

5

Behavior drifts. The language stays similar.

6

Play, explore, cite

Play the auction

A one-minute scripted game built on behaviors from the traces. Bid against four agents and decide whether to keep a pact. It isn’t model output.

Play →

BibTeX

@misc{kumar2026scarce,
  title  = {{SCARCE}: Emergent Institutions in Long-Horizon
            Multi-Agent Coding Systems},
  author = {Kumar, Abhinav and Abebe, Rediet and
            Bagdasarian, Eugene and Abdelnabi, Sahar},
  year   = {2026},
  eprint = {2610.21029},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2610.21029},
  note   = {Preprint}
}