Optimal split of orders across liquidity pools: a stochastic algorithm approach

Abstract : Evolutions of the trading landscape lead to the capability to exchange the same financial instrument on different venues. Because of liquidity issues, the trading firms split large orders across several trading destinations to optimize their execution. To solve this problem we devised two stochastic recursive learning procedures which adjust the proportions of the order to be sent to the different venues, one based on an optimization principle, the other on some reinforcement ideas. Both procedures are investigated from a theoretical point of view: we prove a.s. convergence of the optimization algorithm under some light ergodic (or "averaging") assumption on the input data process. No Markov property is needed. When the inputs are i.i.d. we show that the convergence rate is ruled by a Central Limit Theorem. Finally, the mutual performances of both algorithms are compared on simulated and real data with respect to an "oracle" strategy devised by an "insider" who knows a priori the executed quantities by every venues.
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-00422427
Contributor : Sophie Laruelle <>
Submitted on : Thursday, March 18, 2010 - 3:37:40 PM
Last modification on : Monday, May 29, 2017 - 2:22:44 PM
Document(s) archivé(s) le : Thursday, September 23, 2010 - 6:09:33 PM

Files

Dark_Poolsb22.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00422427, version 3
  • ARXIV : 0910.1166

Collections

PMA | INSMI | UPMC | USPC

Citation

Sophie Laruelle, Charles-Albert Lehalle, Gilles Pagès. Optimal split of orders across liquidity pools: a stochastic algorithm approach. 2010. <hal-00422427v3>

Share

Metrics

Record views

388

Document downloads

433