IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2312.09353.html
   My bibliography  Save this paper

Residual U-net with Self-Attention to Solve Multi-Agent Time-Consistent Optimal Trade Execution

Author

Listed:
  • Andrew Na
  • Justin Wan

Abstract

In this paper, we explore the use of a deep residual U-net with self-attention to solve the the continuous time time-consistent mean variance optimal trade execution problem for multiple agents and assets. Given a finite horizon we formulate the time-consistent mean-variance optimal trade execution problem following the Almgren-Chriss model as a Hamilton-Jacobi-Bellman (HJB) equation. The HJB formulation is known to have a viscosity solution to the unknown value function. We reformulate the HJB to a backward stochastic differential equation (BSDE) to extend the problem to multiple agents and assets. We utilize a residual U-net with self-attention to numerically approximate the value function for multiple agents and assets which can be used to determine the time-consistent optimal control. In this paper, we show that the proposed neural network approach overcomes the limitations of finite difference methods. We validate our results and study parameter sensitivity. With our framework we study how an agent with significant price impact interacts with an agent without any price impact and the optimal strategies used by both types of agents. We also study the performance of multiple sellers and buyers and how they compare to a holding strategy under different economic conditions.

Suggested Citation

  • Andrew Na & Justin Wan, 2023. "Residual U-net with Self-Attention to Solve Multi-Agent Time-Consistent Optimal Trade Execution," Papers 2312.09353, arXiv.org, revised Mar 2024.
  • Handle: RePEc:arx:papers:2312.09353
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2312.09353
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2312.09353. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.