Repository logo
  • Log In
    Log in via Symplectic to deposit your publication(s).
Repository logo
  • Communities & Collections
  • Research Outputs
  • Statistics
  • Log In
    Log in via Symplectic to deposit your publication(s).
  1. Home
  2. Faculty of Natural Sciences
  3. Mathematics
  4. Mathematics PhD theses
  5. Optimal liquidation strategies for large-tick stocks
 
  • Details
Optimal liquidation strategies for large-tick stocks
File(s)
Liu-H-2018-PhD-Thesis.pdf (3.48 MB)
Thesis
Author(s)
Liu, Hao
Type
Thesis or dissertation
Abstract
This thesis is devoted to study the optimal liquidation strategies in a limit order book for large-tick stocks. Two frameworks are proposed.

In the first framework, we formulate a stylised limit order book that admits one-tick spread and fixed market depth cap, in which order flows arrive according to point processes with stochastic intensities. We consider an agent who wants to liquidate a position in this limit order book through market orders and pegged displayed/non-displayed limit orders within a fixed time horizon,
and whose goal is to maximise the expected utility from the terminal wealth. For this optimal liquidation problem,
we derive the associated Hamilton-Jacobi-Bellman quasi-variational inequality and prove a verification theorem giving sufficient conditions for the HJBQVI solution to be the value function. The optimal strategy is a combined stochastic and impulse control, and is then solved numerically using finite different scheme.

In the second framework, we formulate a stylised level-I limit order book whose spread is constantly one tick and whose dynamics are driven by the queueing races at the best prices. Order book events occur according to independent Poisson processes, with parameters depending on the most recent price move direction. Our goal is to maximise the expected terminal wealth of an agent who needs to liquidate a position within a fixed time horizon. By assuming that the agent trades through both limit and market orders only when the price moves, we model her liquidation procedure as a semi-Markov decision process, and compute the semi-Markov kernel using Laplace method in the language of queueing theory. The optimal liquidation policy is then solved by dynamic programming, and illustrated numerically.
Version
Open Access
Date Issued
2018-01
Date Awarded
2018-09
URI
http://hdl.handle.net/10044/1/63865
DOI
https://doi.org/10.25560/63865
Advisor
Jacquier, Antoine
Publisher Department
Mathematics
Publisher Institution
Imperial College London
Qualification Level
Doctoral
Qualification Name
Doctor of Philosophy (PhD)
About
Spiral Depositing with Spiral Publishing with Spiral Symplectic
Contact us
Open access team Report an issue
Other Services
Scholarly Communications Library Services
logo

Imperial College London

South Kensington Campus

London SW7 2AZ, UK

tel: +44 (0)20 7589 5111

Accessibility Modern slavery statement Cookie Policy

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback