AERead · Pilot V0

Methods & artifacts

Everything needed to read the numbers on the overview and evidence pages: the models and their roles, the four cases, the exact scoring equation, the baseline algorithms, the seed and held-out protocol, what "validated" means, and where the raw data lives. This is a summary of a live research record — the repository is the source of truth.

01 / Models & rolesThe seven-model A2A leaderboard.

Each candidate is placed in one seat of a five-agent market; the other four seats (the panel) are a frozen gemini-2.5-flash at temperature 0. A frozen gemini-2.5-flash also serves as the environment's compiler (turns accepted agreements into asset transfers) and verifier. Candidates run at temperature 0; non-Gemini models are served via OpenRouter, Gemini models via the AI-Studio native endpoint. Development leaderboard scores are pooled AER over the four cases (ratio of sums), 30 development seeds each, bootstrap 95% intervals.

ModelProviderDev pooled AER95% CIHeld-out
gemini-3.5-flashGoogle+.209[.176, .243]◇ yes
kimi-k2Moonshot+.156[.131, .183]◇ yes
deepseek-v4-flashDeepSeek+.116[.089, .144]◇ yes
greedy floor (baseline)+.104[.092, .116]◇ yes
gemini-2.5-flashGoogle+.083[.065, .101]◇ yes
minimax-m3MiniMax+.028[.014, .045]◇ yes
glm-4.7-flashZ.ai+.014[.005, .025]◇ yes
random (baseline)+.008[.003, .015]◇ yes

Every model and baseline now carries a private held-out score (◇). The four cross-provider models were added to the held-out set on 2026-07-22 (480 runs, ranking preserved, no overfitting signature). Exact API model versions per run are recorded in each run's run_meta.json / inference manifest.

02 / CasesFour five-agent market cases (cases_v0).

Each case emphasizes one capability (the cases also vary in other dimensions — read them as a family, not a single-variable manipulation). All are five agents / five resources.

CaseEmphasisRoundsVisibilitySettlement
case01 · bilateralvisible bilateral IR trade4full publicatomic commit, ≤2 rows
case02 · clearingmultiparty partial clearing4full publicnon-atomic, ≤4 rows
case03 · discoveryhidden counterparties + solicitation6limited contact — sees 1 of 4non-atomic, ≤4 rows
case04 · consentprivate information + sign-off4limited contact — sees 2 of 4non-atomic, ≤4 rows, private acceptance

Reward is realized economic outcome (welfare) plus valid exchange — never string-matching a preferred answer. Per-case world generators are pinned by content hash; the exact distributions are in the pinned case configs in the repository.

03 / Scoring — the AEROne equation.

The Aggregate Efficiency Ratio is market-level welfare — the whole five-seat market — not the tested agent's private surplus. For each case, pooled over seeds:

AER = Σs ( Wrealized − Winitial ) ⁄ Σs ( W* − Winitial )

Bootstrap: resampling unit is the world (seed); 2000 replicates; percentile intervals. Differences (e.g. model − baseline) are paired within-world. Confidence intervals on the pooled leaderboard are marginal — see the held-out margin-over-floor analysis on the evidence page for paired difference intervals.

04 / BaselinesThe greedy floor, defined.

The central finding — that a trivial deterministic baseline stays competitive — rests on the greedy floor, so here is exactly what it does. It sees the same visible state the model does (no god's-eye access) and never touches the language compiler; its welfare is computed directly.

greedy_floor(world, protocol, rounds):
  gain = 0
  for round in 1..rounds:
    controller = rotate(controllers)
    visible = agents controller may contact this round     # same visibility as the LLM
    swap = best mutually-IR bilateral trade among `visible` # exact, subject to the row limit
    if welfare_gain(swap) > 0:
      apply(swap); gain += welfare_gain(swap)
  return gain                                              # scored by the same AER as the models

So the greedy floor is not naive: each round it takes the exact welfare-maximizing one-step bilateral trade among the agents it can see. It cannot discover beyond its visible set, cannot plan across rounds, and cannot do multiparty clearing. random proposes a feasible random transfer each round; no-op proposes nothing (always scores 0, and is omitted from the boards). The greedy floor uses the same oracle-computed welfare as every model, so the comparison is on outcome, not on parsing.

05 / Seeds & held-outDevelopment vs private held-out.

The private held-out seed set + generator salt are kept locally and never published; a leaked seed set would void the held-out claim.

06 / ValidationWhat "validated" means.

Every scored run is replay-verified: re-running the recorded transcript through the scoring pipeline reproduces the numbers byte-for-byte. "Validated" on this site means replay-consistency and numerical reproducibilitynot human review of every transcript, and not independent external replication. Two robustness checks are reported on the evidence page: a four-case panel swap (frozen-LLM panel → scripted-rational panel) and the private held-out re-scoring.

Known open validation items: a compiler audit (per-model false-accept / false-reject rates on a human-labeled sample), multi-provider and mixed panels, and a structured-action condition that bypasses natural-language compilation.

07 / ArtifactsWhere the data lives.

This page and the CSV are a curated summary; the repository run records are the source of truth. Prompts, role instructions, and full per-seat inference settings are recorded per run rather than reproduced here.

08 / ReferencesRelated work.