Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > q-fin > arXiv:2304.02180

Help | Advanced Search

Quantitative Finance > Trading and Market Microstructure

arXiv:2304.02180 (q-fin)
[Submitted on 5 Apr 2023 ]

Title: Optimal Trading in Automatic Market Makers with Deep Learning

Title: 带有深度学习的自动做市商中的最优交易

Authors:Sebastian Jaimungal, Yuri F. Saporito, Max O. Souza, Yuri Thamsten
Abstract: This article explores the optimisation of trading strategies in Constant Function Market Makers (CFMMs) and centralised exchanges. We develop a model that accounts for the interaction between these two markets, estimating the conditional dependence between variables using the concept of conditional elicitability. Furthermore, we pose an optimal execution problem where the agent hides their orders by controlling the rate at which they trade. We do so without approximating the market dynamics. The resulting dynamic programming equation is not analytically tractable, therefore, we employ the deep Galerkin method to solve it. Finally, we conduct numerical experiments and illustrate that the optimal strategy is not prone to price slippage and outperforms na\"ive strategies.
Abstract: 本文探讨了在恒定函数做市商(CFMM)和集中式交易所中的交易策略优化。我们建立了一个考虑这两个市场之间相互作用的模型,使用条件可获取性的概念来估计变量之间的条件依赖性。此外,我们提出了一个最优执行问题,其中代理通过控制交易速率来隐藏其订单。我们没有对市场动态进行近似。 resulting dynamic programming equation 不是解析可处理的,因此,我们采用深度Galerkin方法来解决它。最后,我们进行了数值实验并说明最优策略不易受到价格滑点的影响,并优于简单策略。
Subjects: Trading and Market Microstructure (q-fin.TR)
Cite as: arXiv:2304.02180 [q-fin.TR]
  (or arXiv:2304.02180v1 [q-fin.TR] for this version)
  https://doi.org/10.48550/arXiv.2304.02180
arXiv-issued DOI via DataCite

Submission history

From: Yuri F. Saporito [view email]
[v1] Wed, 5 Apr 2023 01:09:55 UTC (2,168 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
q-fin.TR
< prev   |   next >
new | recent | 2023-04
Change to browse by:
q-fin

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号