Author
Listed:
- Etienne Chevalier
(LaMME - Laboratoire de Mathématiques et Modélisation d'Evry - ENSIIE - Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise - UEVE - Université d'Évry-Val-d'Essonne - Université Paris-Saclay - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement)
- Yadh Hafsi
(LaMME - Laboratoire de Mathématiques et Modélisation d'Evry - ENSIIE - Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise - UEVE - Université d'Évry-Val-d'Essonne - Université Paris-Saclay - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement)
- Vathana Ly Vath
(LaMME - Laboratoire de Mathématiques et Modélisation d'Evry - ENSIIE - Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise - UEVE - Université d'Évry-Val-d'Essonne - Université Paris-Saclay - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement)
Abstract
We study optimal liquidation strategies under partial information for a single asset within a finite time horizon. We propose a model tailored for high-frequency trading, capturing price formation driven solely by order flow through mutually stimulating marked Hawkes processes. The model assumes a limit order book framework, accounting for both permanent price impact and transient market impact. Importantly, we incorporate liquidity as a hidden Markov process, influencing the intensities of the point processes governing bid and ask prices. Within this setting, we formulate the optimal liquidation problem as an impulse control problem. We elucidate the dynamics of the hidden Markov chain's filter and determine the related normalized filtering equations. We then express the value function as the limit of a sequence of auxiliary continuous functions, defined recursively. This characterization enables the use of a dynamic programming principle for optimal stopping problems and the determination of an optimal strategy. It also facilitates the development of an implementable algorithm to approximate the original liquidation problem. We enrich our analysis with numerical results and visualizations of candidate optimal strategies.
Suggested Citation
Etienne Chevalier & Yadh Hafsi & Vathana Ly Vath, 2024.
"Optimal Execution under Incomplete Information,"
Working Papers
hal-04817891, HAL.
Handle:
RePEc:hal:wpaper:hal-04817891
Note: View the original document on HAL open archive server: https://hal.science/hal-04817891v1
Download full text from publisher
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:hal:wpaper:hal-04817891. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.