Closed-form solutions for generic N-token AMM arbitrage

Matthew Willetts, Christian Harrington
{"title":"Closed-form solutions for generic N-token AMM arbitrage","authors":"Matthew Willetts, Christian Harrington","doi":"arxiv-2402.06731","DOIUrl":null,"url":null,"abstract":"Convex optimisation has provided a mechanism to determine arbitrage trades on\nautomated market markets (AMMs) since almost their inception. Here we outline\ngeneric closed-form solutions for $N$-token geometric mean market maker pool\narbitrage, that in simulation (with synthetic and historic data) provide better\narbitrage opportunities than convex optimisers and is able to capitalise on\nthose opportunities sooner. Furthermore, the intrinsic parallelism of the\nproposed approach (unlike convex optimisation) offers the ability to scale on\nGPUs, opening up a new approach to AMM modelling by offering an alternative to\nnumerical-solver-based methods. The lower computational cost of running this\nnew mechanism can also enable on-chain arbitrage bots for multi-asset pools.","PeriodicalId":501478,"journal":{"name":"arXiv - QuantFin - Trading and Market Microstructure","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - QuantFin - Trading and Market Microstructure","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2402.06731","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Convex optimisation has provided a mechanism to determine arbitrage trades on automated market markets (AMMs) since almost their inception. Here we outline generic closed-form solutions for $N$-token geometric mean market maker pool arbitrage, that in simulation (with synthetic and historic data) provide better arbitrage opportunities than convex optimisers and is able to capitalise on those opportunities sooner. Furthermore, the intrinsic parallelism of the proposed approach (unlike convex optimisation) offers the ability to scale on GPUs, opening up a new approach to AMM modelling by offering an alternative to numerical-solver-based methods. The lower computational cost of running this new mechanism can also enable on-chain arbitrage bots for multi-asset pools.
通用 Noken AMM 套利的闭式解法
自自动市场(AMMs)诞生以来,凸优化就为其提供了一种确定套利交易的机制。在此,我们概述了 $N$ 代币几何平均数做市商池套利的通用闭式解决方案,在模拟(使用合成数据和历史数据)中,它比凸优化器提供了更好的套利机会,并能更快地利用这些机会。此外,拟议方法的内在并行性(不同于凸优化)提供了在 GPU 上扩展的能力,通过提供基于数值求解器的方法的替代方案,为 AMM 建模开辟了新途径。运行这种新机制的计算成本较低,因此也能为多资产池提供链上套利机器人。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信