Optimal order placement in limit order markets
AbstractTo execute a trade, participants in electronic equity markets may choose to submit limit orders or market orders across various exchanges where a stock is traded. This decision is influenced by the characteristics of the order flow and queue sizes in each limit order book, as well as the structure of transaction fees and rebates across exchanges. We propose a quantitative framework for studying this order placement problem by formulating it as a convex optimization problem. This formulation allows to study how the interplay between the state of order books, the fee structure, order flow properties and preferences of a trader determine the optimal placement decision. In the case of a single exchange, we derive an explicit solution for the optimal split between limit and market orders. For the general problem of order placement across multiple exchanges, we propose a stochastic algorithm for computing the optimal policy and study the sensitivity of the solution to various parameters using a numerical implementation of the algorithm.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by HAL in its series Working Papers with number hal-00737491.
Date of creation: 01 Oct 2012
Date of revision:
Note: View the original document on HAL open archive server: http://hal.archives-ouvertes.fr/hal-00737491
Contact details of provider:
Web page: http://hal.archives-ouvertes.fr/
order routing; limit order book; limit order market; liquidity; optimal order execution; transaction costs; market microstructure;
This paper has been announced in the following NEP Reports:
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Thierry Foucault & Albert J. Menkveld, 2008.
"Competition for Order Flow and Smart Order Routing Systems,"
Journal of Finance,
American Finance Association, vol. 63(1), pages 119-158, 02.
- Foucault, Thierry & Menkveld, Albert J., 2006. "Competition for Order Flow and Smart Order Routing Systems," CEPR Discussion Papers 5523, C.E.P.R. Discussion Papers.
- Foucault, Thierry & Menkveld, Albert, 2006. "Competition for order flow and smart order routing systems," Les Cahiers de Recherche 831, HEC Paris.
- Olivier Gu\'eant & Charles-Albert Lehalle, 2012. "General Intensity Shapes in Optimal Liquidation," Papers 1204.0148, arXiv.org, revised Jun 2013.
- Aurelien Alfonsi & Antje Fruth & Alexander Schied, 2010. "Optimal execution strategies in limit order books with general shape functions," Quantitative Finance, Taylor & Francis Journals, vol. 10(2), pages 143-157.
- Fabien Guilbaud & Huyên Pham, 2012. "Optimal High Frequency Trading in a Pro-Rata Microstructure with Predictive Information," Working Papers hal-00697125, HAL.
- Aur\'elien Alfonsi & Antje Fruth & Alexander Schied, 2007. "Optimal execution strategies in limit order books with general shape functions," Papers 0708.1756, arXiv.org, revised Feb 2010.
- Sophie Laruelle & Charles-Albert Lehalle & Gilles Pag\`es, 2009.
"Optimal split of orders across liquidity pools: a stochastic algorithm approach,"
0910.1166, arXiv.org, revised May 2010.
- Sophie Laruelle & Charles-Albert Lehalle & Gilles Pagès, 2009. "Optimal split of orders across liquidity pools: a stochastic algorithm approach," Working Papers hal-00422427, HAL.
- Fabien Guilbaud & Huy\^en Pham, 2012. "Optimal High Frequency Trading in a Pro-Rata Microstructure with Predictive Information," Papers 1205.3051, arXiv.org.
- Anna Obizhaeva & Jiang Wang, 2005. "Optimal Trading Strategy and Supply/Demand Dynamics," NBER Working Papers 11444, National Bureau of Economic Research, Inc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (CCSD).
If references are entirely missing, you can add them using this form.