IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i21p3440-d1513350.html
   My bibliography  Save this article

Joint Learning of Volume Scheduling and Order Placement Policies for Optimal Order Execution

Author

Listed:
  • Siyuan Li

    (Faculty of Computing, Harbin Institute of Technology, Harbin 150001, China)

  • Hui Niu

    (Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing 100084, China)

  • Jiani Lu

    (Faculty of Computing, Harbin Institute of Technology, Harbin 150001, China)

  • Peng Liu

    (Faculty of Computing, Harbin Institute of Technology, Harbin 150001, China)

Abstract

Order execution is an extremely important problem in the financial domain, and recently, more and more researchers have tried to employ reinforcement learning (RL) techniques to solve this challenging problem. There are a lot of difficulties for conventional RL methods to tackle the order execution problem, such as the large action space including price and quantity, and the long-horizon property. As naturally order execution is composed of a low-frequency volume scheduling stage and a high-frequency order placement stage, most existing RL-based order execution methods treat these stages as two distinct tasks and offer a partial solution by addressing either one individually. However, the current literature fails to model the non-negligible mutual influence between these two tasks, leading to impractical order execution solutions. To address these limitations, we propose a novel automatic order execution approach based on the hierarchical RL framework (OEHRL), which jointly learns the policies for volume scheduling and order placement. OEHRL first extracts the state embeddings at both the macro and micro levels with a sequential variational auto-encoder model. Based on the effective embeddings, OEHRL generates a hindsight expert dataset, which is used to train a hierarchical order execution policy. In the hierarchical structure, the high-level policy is in charge of the target volume and the low-level learns to determine the prices for a series of the allocated sub-orders from the high level. These two levels collaborate seamlessly and contribute to the optimal order execution policy. Extensive experiment results on 200 stocks across the US and China A-share markets validate the effectiveness of the proposed approach.

Suggested Citation

  • Siyuan Li & Hui Niu & Jiani Lu & Peng Liu, 2024. "Joint Learning of Volume Scheduling and Order Placement Policies for Optimal Order Execution," Mathematics, MDPI, vol. 12(21), pages 1-17, November.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:21:p:3440-:d:1513350
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/21/3440/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/21/3440/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:12:y:2024:i:21:p:3440-:d:1513350. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.