Metraipolis › archive › dc_f7a446bc7ee5
When AI Agents Meet MEV: Cross-Chain Arbitrage in the Agentic Economy — arXiv:2609.17897
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.17897
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T14:31:35.523Z
- SHA-256 of the archived text
b75a7b3b5880cab21e71d06e0347f4f020dc10c956ed9eb7d3a7dab7e983fb1f- Stable URL of this page
https://metraipolis.com/documento/dc_f7a446bc7ee5
How to cite
When AI Agents Meet MEV: Cross-Chain Arbitrage in the Agentic Economy — arXiv:2609.17897 — arXiv (en), https://arxiv.org/abs/2609.17897 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f7a446bc7ee5 (Metraipolis archive dc_f7a446bc7ee5, sha256 b75a7b3b5880cab21e71d06e0347f4f020dc10c956ed9eb7d3a7dab7e983fb1f)
BibTeX
@misc{dcf7a446bc7ee5,
title = {When AI Agents Meet MEV: Cross-Chain Arbitrage in the Agentic Economy — arXiv:2609.17897},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.17897},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f7a446bc7ee5; sha256 b75a7b3b5880cab21e71d06e0347f4f020dc10c956ed9eb7d3a7dab7e983fb1f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.17897. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study cross-chain arbitrage when autonomous AI agents, rather than humans or bots, are the searchers. We model agents as both arbitrage extractors and Maximal Extractable Value targets, derive the optimal trade size for a risk-averse agent under mean-variance utility with stochastic bridge delays, and formalize multi-chain path selection as a belief-weighted online learning problem whose belief estimates converge under a Robbins-Monro schedule. Using 23,000 Uniswap V3 swap events across Ethereum, Arbitrum, and Base, we find that Ethereum-Arbitrum price gaps average 0.044% at 10-second resolution and Arbitrum--Base gaps average 0.013%, so $10,000 trades clear in 63% of L2-L2 windows via CCTP while L1-L2 routes require $50,000 or more for comparable viability. Our adaptive path-selection algorithm outperforms standard baselines by 11% on average, and moderate randomization cuts MEV exposure by over 50% with only modest profit loss. Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-09-17 in cs.CR). Categorie arXiv: Cryptography and Security (cs.CR) ; Computational Engineering, Finance, and Science (cs.CE). Pagina del lavoro: https://arxiv.org/abs/2609.17897 — 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-10-15T13:56:52.836Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).