IDEAS home Printed from https://ideas.repec.org/a/rsk/journ0/7956981.html
   My bibliography  Save this article

An optimal control strategy for execution of large stock orders using long short-term memory networks

Author

Listed:
  • Andrew Papanicolaou
  • Hao Fu
  • Prasanth Krishnamurthy
  • Brian Healy
  • Farshad Khorrami

Abstract

We simulate the execution of a large stock order with real data and a general power law in the Almgren and Chriss model. The example we consider is the liquidation of a large position executed over the course of a single trading day in a limit order book. Transaction costs are incurred because large orders walk the order book (that is, they consume order book liquidity beyond the best bid/ask price). We model the order book with a power law that is proportional to trading volume, and thus transaction costs are inversely proportional to a power of the trading volume. We obtain a policy approximation by training a long short-term memory (LSTM) neural network to minimize the transaction costs accumulated when execution is carried out as a sequence of smaller suborders. Using historical Standard & Poor’s 100 price and volume data, we evaluate our LSTM strategy relative to strategies based on the time-weighted average price (TWAP) and volume-weighted average price (VWAP). For execution of a single stock, the input to the LSTM is the cross-section of data on all 100 stocks, including prices, volumes, TWAPs and VWAPs. By using this data cross-section, the LSTM should be able to exploit interstock codependence in volume and price movements, thereby reducing transaction costs for the day. Our tests on Standard & Poor’s 100 data demonstrate that in fact this is so, as our LSTM strategy consistently outperforms TWAP- and VWAP-based strategies.

Suggested Citation

Handle: RePEc:rsk:journ0:7956981
as

Download full text from publisher

File URL: https://www.risk.net/system/files/digital_asset/2023-07/jcf_Papanicolaou_web_final.pdf
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:rsk:journ0:7956981. 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: Thomas Paine (email available below). General contact details of provider: https://www.risk.net/journal-of-computational-finance .

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.