Metraipolis › archive › dc_dcbc4afb5cb3
Circumventing the Computational Hardness of Computational Arbitrage — arXiv:2610.40831
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.40831
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T07:50:22.663Z
- SHA-256 of the archived text
bcbe3b0938862a0fb33f4938ddd44299a277081499ed03db067ca6a21696bd97- Stable URL of this page
https://metraipolis.com/documento/dc_dcbc4afb5cb3
How to cite
Circumventing the Computational Hardness of Computational Arbitrage — arXiv:2610.40831 — arXiv (en), https://arxiv.org/abs/2610.40831 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dcbc4afb5cb3 (Metraipolis archive dc_dcbc4afb5cb3, sha256 bcbe3b0938862a0fb33f4938ddd44299a277081499ed03db067ca6a21696bd97)
BibTeX
@misc{dcdcbc4afb5cb3,
title = {Circumventing the Computational Hardness of Computational Arbitrage — arXiv:2610.40831},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.40831},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dcbc4afb5cb3; sha256 bcbe3b0938862a0fb33f4938ddd44299a277081499ed03db067ca6a21696bd97},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40831. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
AI model marketplaces host providers with heterogeneous costs and capabilities. These differences create an opportunity for computational arbitrage (Olmedo et al., 2026), in which an intermediary purchases inference from a portfolio of models and resells it to users at a profit. Beyond creating profit opportunities for the arbitrageur, computational arbitrage offers financial value to both consumers and providers and could therefore significantly influence AI model markets. While prior work empirically demonstrates the feasibility of computational arbitrage for small model pools, scaling it to large marketplaces requires arbitrage strategies that are both computationally tractable and inexpensive to identify and deploy. In this work, we formalize computational arbitrage as an allocation problem and prove that it is generally NP-hard. However, we show that the optimal allocation can be computed efficiently under a natural diminishing-returns condition on how model performance scales with inference spending. We further develop a sample-efficient method for estimating model performance from limited data, reducing the upfront cost of identifying arbitrage strategies. Our analysis also yields several economic insights: at the optimum, every funded model delivers the same marginal utility per dollar; arbitrage directs revenue away from providers offering little utility relative to their prices; and it rewards complementary specialization. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno). Categorie arXiv: Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2610.40831 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T07:49:31.010Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).