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

Tackling the Problem of State Dependent Execution Probability: Empirical Evidence and Order Placement

Author

Listed:
  • Timoth'ee Fabre
  • Vincent Ragel

Abstract

Order placement tactics play a crucial role in high-frequency trading algorithms and their design is based on understanding the dynamics of the order book. Using high quality high-frequency data and survival analysis, we exhibit strong state dependence properties of the fill probability function. We define a set of microstructure features and train a multi-layer perceptron to infer the fill probability function. A weighting method is applied to the loss function such that the model learns from censored data. By comparing numerical results obtained on both digital asset centralized exchanges (CEXs) and stock markets, we are able to analyze dissimilarities between the fill probability of small tick crypto pairs and large tick assets -- large, relative to cryptos. The practical use of this model is illustrated with a fixed time horizon execution problem in which both the decision to post a limit order or to immediately execute and the optimal distance of placement are characterized. We discuss the importance of accurately estimating the clean-up cost that occurs in the case of a non-execution and we show it can be well approximated by a smooth function of market features. We finally assess the performance of our model with a backtesting approach that avoids the insertion of hypothetical orders and makes possible to test the order placement algorithm with orders that realistically impact the price formation process.

Suggested Citation

  • Timoth'ee Fabre & Vincent Ragel, 2023. "Tackling the Problem of State Dependent Execution Probability: Empirical Evidence and Order Placement," Papers 2307.04863, arXiv.org.
    • Handle: RePEc:arx:papers:2307.04863
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Erhan Bayraktar & Michael Ludkovski, 2014. "Liquidation In Limit Order Books With Controlled Intensity," Mathematical Finance, Wiley Blackwell, vol. 24(4), pages 627-650, October.
    2. �lvaro Cartea & Sebastian Jaimungal, 2015. "Optimal execution with limit and market orders," Quantitative Finance, Taylor & Francis Journals, vol. 15(8), pages 1279-1291, August.
    3. Vladimir Markov, 2014. "On the design of sell-side limit and market order tactics," Papers 1409.1442, arXiv.org.
    4. P. Weber & B. Rosenow, 2005. "Order book approach to price impact," Quantitative Finance, Taylor & Francis Journals, vol. 5(4), pages 357-364.
    5. Zoltan Eisler & Janos Kertesz & Fabrizio Lillo & Rosario Mantegna, 2009. "Diffusive behavior and the modeling of characteristic times in limit order executions," Quantitative Finance, Taylor & Francis Journals, vol. 9(5), pages 547-563.
    6. Marco Avellaneda & Sasha Stoikov, 2008. "High-frequency trading in a limit order book," Quantitative Finance, Taylor & Francis Journals, vol. 8(3), pages 217-224.
    7. Laszlo Gillemot & J. Doyne Farmer & Fabrizio Lillo, 2006. "There's more to volatility than volume," Quantitative Finance, Taylor & Francis Journals, vol. 6(5), pages 371-384.
    8. Hautsch, Nikolaus & Huang, Ruihong, 2012. "The market impact of a limit order," Journal of Economic Dynamics and Control, Elsevier, vol. 36(4), pages 501-522.
    9. Alvaro Arroyo & Alvaro Cartea & Fernando Moreno-Pino & Stefan Zohren, 2023. "Deep Attentive Survival Analysis in Limit Order Books: Estimating Fill Probabilities with Convolutional-Transformers," Papers 2306.05479, arXiv.org.
    10. Emmanuel Bacry & Thibault Jaisson & Jean--François Muzy, 2016. "Estimation of slowly decreasing Hawkes kernels: application to high-frequency order book dynamics," Quantitative Finance, Taylor & Francis Journals, vol. 16(8), pages 1179-1201, August.
    11. Jonathan Brogaard & Terrence Hendershott & Ryan Riordan, 2019. "Price Discovery without Trading: Evidence from Limit Orders," Journal of Finance, American Finance Association, vol. 74(4), pages 1621-1658, August.
    12. Christian Y. Robert & Mathieu Rosenbaum, 2011. "A New Approach for the Dynamics of Ultra-High-Frequency Data: The Model with Uncertainty Zones," Journal of Financial Econometrics, Oxford University Press, vol. 9(2), pages 344-366, Spring.
    13. Lo, Andrew W. & MacKinlay, A. Craig & Zhang, June, 2002. "Econometric models of limit-order executions," Journal of Financial Economics, Elsevier, vol. 65(1), pages 31-71, July.
    14. John K. Wald & H. T. Horrigan, 2005. "Optimal Limit Order Choice," The Journal of Business, University of Chicago Press, vol. 78(2), pages 597-620, March.
    15. Rama Cont & Arseniy Kukanov, 2017. "Optimal order placement in limit order markets," Quantitative Finance, Taylor & Francis Journals, vol. 17(1), pages 21-39, January.
    16. Ryan Donnelly & Luhui Gan, 2018. "Optimal Decisions in a Time Priority Queue," Applied Mathematical Finance, Taylor & Francis Journals, vol. 25(2), pages 107-147, March.
    17. Zoltán Eisler & Jean-Philippe Bouchaud & Julien Kockelkoren, 2012. "The price impact of order book events: market orders, limit orders and cancellations," Quantitative Finance, Taylor & Francis Journals, vol. 12(9), pages 1395-1419, September.
    18. Josep Perell'o & Mario Guti'errez-Roig & Jaume Masoliver, 2011. "Scaling properties and universality of first-passage time probabilities in financial markets," Papers 1107.1174, arXiv.org, revised Sep 2011.
    19. Pablo Gonzalez Ginestet & Ales Kotalik & David M. Vock & Julian Wolfson & Erin E. Gabriel, 2021. "Stacked inverse probability of censoring weighted bagging: A case study in the InfCareHIV Register," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 70(1), pages 51-65, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Olivier Guéant, 2016. "The Financial Mathematics of Market Liquidity: From Optimal Execution to Market Making," Post-Print hal-01393136, HAL.
    2. Chen, Yuanyuan & Gao, Xuefeng & Li, Duan, 2018. "Optimal order execution using hidden orders," Journal of Economic Dynamics and Control, Elsevier, vol. 94(C), pages 89-116.
    3. Federico Gonzalez & Mark Schervish, 2017. "Instantaneous order impact and high-frequency strategy optimization in limit order books," Papers 1707.01167, arXiv.org, revised Oct 2017.
    4. Antonio Briola & Silvia Bartolucci & Tomaso Aste, 2024. "Deep Limit Order Book Forecasting," Papers 2403.09267, arXiv.org, revised Mar 2024.
    5. Massil Achab & Emmanuel Bacry & Jean-Franc{c}ois Muzy & Marcello Rambaldi, 2017. "Analysis of order book flows using a nonparametric estimation of the branching ratio matrix," Papers 1706.03411, arXiv.org.
    6. Thomas A. P. de Boer & Cornelis Gardebroek & Joost M. E. Pennings & Andres Trujillo‐Barrera, 2022. "Intraday liquidity in soybean complex futures markets," Journal of Futures Markets, John Wiley & Sons, Ltd., vol. 42(7), pages 1189-1211, July.
    7. Thibault Jaisson, 2015. "Liquidity and Impact in Fair Markets," Papers 1506.02507, arXiv.org.
    8. Weibing Huang & Charles-Albert Lehalle & Mathieu Rosenbaum, 2015. "Simulating and Analyzing Order Book Data: The Queue-Reactive Model," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 110(509), pages 107-122, March.
    9. Schnaubelt, Matthias, 2022. "Deep reinforcement learning for the optimal placement of cryptocurrency limit orders," European Journal of Operational Research, Elsevier, vol. 296(3), pages 993-1006.
    10. Du, Bian & Zhu, Hongliang & Zhao, Jingdong, 2016. "Optimal execution in high-frequency trading with Bayesian learning," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 767-777.
    11. Gao, Xuefeng & Xu, Tianrun, 2022. "Order scoring, bandit learning and order cancellations," Journal of Economic Dynamics and Control, Elsevier, vol. 134(C).
    12. Saran Ahuja & George Papanicolaou & Weiluo Ren & Tzu-Wei Yang, 2016. "Limit order trading with a mean reverting reference price," Papers 1607.00454, arXiv.org, revised Nov 2016.
    13. Hadrien De March & Charles-Albert Lehalle, 2018. "Optimal trading using signals," Papers 1811.03718, arXiv.org.
    14. Kashyap, Ravi, 2020. "David vs Goliath (You against the Markets), A dynamic programming approach to separate the impact and timing of trading costs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    15. Sadoghi, Amirhossein & Vecer, Jan, 2022. "Optimal liquidation problem in illiquid markets," European Journal of Operational Research, Elsevier, vol. 296(3), pages 1050-1066.
    16. Amirhossein Sadoghi & Jan Vecer, 2022. "Optimal liquidation problem in illiquid markets," Post-Print hal-03696768, HAL.
    17. Schnaubelt, Matthias, 2020. "Deep reinforcement learning for the optimal placement of cryptocurrency limit orders," FAU Discussion Papers in Economics 05/2020, Friedrich-Alexander University Erlangen-Nuremberg, Institute for Economics.
    18. Pietro Fodra & Huy^en Pham, 2013. "High frequency trading and asymptotics for small risk aversion in a Markov renewal model," Papers 1310.1756, arXiv.org, revised Jan 2015.
    19. Pietro Fodra & Huyen Pham, 2013. "High frequency trading in a Markov renewal model," Working Papers hal-00867113, HAL.
    20. Matthew Lorig & Zhou Zhou & Bin Zou, 2019. "Optimal Bookmaking," Papers 1907.01056, arXiv.org, revised Mar 2021.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:2307.04863. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.