When multiple AI model providers compete on price and performance, their pricing doesn't perfectly track their capabilities. One provider might charge more per token for a model that's worse at math but better at code. Another might have a cheaper model that outperforms on a specific benchmark.
The authors (arXiv:2603.22404) formalize this as computational arbitrage. In domains where outputs are verifiable — math, code, factual queries — you can route tasks to whichever provider offers the best price-performance ratio, accept only correct answers, and profit from the pricing inefficiency. The net margins reach up to 40% on verifiable domains.
The strategy is simple: given a task, estimate which provider will solve it correctly at the lowest cost, submit, verify, and pocket the difference between what the customer pays and what the cheapest correct solution costs. The verification is key — without it, you can't distinguish correct from incorrect outputs, and the arbitrage collapses.
The through-claim: AI model markets have the same structure as financial markets — when multiple providers price overlapping capabilities differently, arbitrage opportunities exist. But unlike financial arbitrage, computational arbitrage requires verification. The margin depends on your ability to check answers, which means it exists only in verifiable domains. Unverifiable tasks have no arbitrage because you can't tell if you got a good deal.