← All projectsGitHub
Markets as routers

What does late feedback cost a market router?

research/delayed-routing

Hedge/LMSR routing with delayed feedback: regret ≤ ln N/η + ηT/8 + ηD/2 (mean delay inflates horizon by 1+4d̄), 12× regret from ignoring delay against a reactive adversary, delay-tuned rate too cautious on oblivious data, LMSR subsidy ~20× at mean delay 5.

11 tests

What it found

Hedge/LMSR routing of modular experts when losses arrive after device-dependent delays: regret ≤ ln N/η + ηT/8 + ηD/2 with D the total outstanding rounds, so mean delay d̄ inflates the horizon by 1+4d̄; ignoring delay costs 12× regret against a reactive adversary at delay 100, the worst-case tuned rate is too cautious on oblivious data, an observable-count adaptive rate recovers most of it, and LMSR subsidy grows about 20× at mean delay 5. Stylised.

A figure from its own output

Figure produced by research/delayed-routing: punish_leader
delayed-routing/experiments/punish_leader.svg, written by the project's own experiment code.

Paper, code and results

More in Markets as routers

All 13 Markets as routers projects →

Other research topics

Proper scoring & elicitation28Effort & peer prediction9Verification games & slashing19Detection & tolerances14Markets as routers13Prediction-market design9Paying contributors8Decentralised training systems23Digital twins & sim-to-real164LLM chip design loops40Robot manufacturing loops53Ambient AI assistant46Self-replicating manufacturing34Simulation-first design64Engineered clothing45Task-specific AI accelerators40Algorithmic chip-design loops42Open-source purpose-built robots44The software-engineering loop43Adversarial human imitation41Open-source residential construction41Autonomous multi-angle capture34Sensing, imaging and 3D31Energy supply and dense energy storage39Robot societies among people31Agentic co-design of low-cost robots27Laundry-hanging robots25Machine learning on qualitative data23Robots on the building site27Civilizations & group psychology1History & human sciences1

Produced with AI assistance (Claude). Results are from the code in this repository and are simulated or stylised unless the abstract says otherwise; nothing here implies affiliation with or endorsement by any lab, researcher or company cited. MIT licensed.