Reducing transaction costs with low-latency trading algorithms

Sasha Stoikov and Rolf Waeber

Quantitative Finance, 2016, vol. 16, issue 9, 1445-1451

Abstract: We formulate a trade execution problem at the market microstructure level and solve it using dynamic programming. The objective is to sell a single lot of an asset in a short time horizon T, using the imbalance of the top of book bid and ask sizes as a price predictor. The optimization problem takes into account the latency L of the trading algorithm, which affects the prices at which the asset is traded. The solution divides the state space into a ‘trade’ and a ‘no-trade’ region. We calculate the cost of latency per lot traded and demonstrate that the advantage of observing the limit order book can dissipate quickly as execution latency increases. In the empirical section, we show that our optimal policy significantly outperforms a TWAP algorithm in liquidating on-the-run US treasury bonds, saving on average approximately 1/3 of the spread per share if trades are executed with low latency (≈$ \approx $1 ms).

Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://hdl.handle.net/10.1080/14697688.2016.1151926 (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:quantf:v:16:y:2016:i:9:p:1445-1451

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

DOI: 10.1080/14697688.2016.1151926

Access Statistics for this article

Quantitative Finance is currently edited by Michael Dempster and Jim Gatheral

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