Optimal execution strategy in liquidity framework

Chiara Benazzoli and Luca Di Persio

Cogent Economics & Finance, 2017, vol. 5, issue 1, 1364902

Abstract: A trader wishes to execute a given number of shares of an illiquid asset. Since the asset price also depends on the trading behaviour, the trader main aim is to find the execution strategy that minimizes the related expected costs. We solve this problem in a discrete time framework, by modeling the asset price dynamic as an arithmetic random walk with drift and volatility both modeled as Markov stochastic processes. The market impact is assumed to follow a Markov process. We found the unique execution strategy minimizing the implementation shortfall when short selling is allowed. This optimal strategy is given as solution of a forward-backward system of stochastic equations depending on conditional expectations of future values of model parameters. In the opposite case, namely when short selling is prohibited, we numerically obtain the solution for the associated Bellman equation that an optimal trading strategy must satisfy.

Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/23322039.2017.1364902 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:oaefxx:v:5:y:2017:i:1:p:1364902

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/OAEF20

DOI: 10.1080/23322039.2017.1364902

Access Statistics for this article

Cogent Economics & Finance is currently edited by Steve Cook, Caroline Elliott, David McMillan, Duncan Watson and Xibin Zhang

More articles in Cogent Economics & Finance from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().