HAL: hal-00650314, version 1

arXiv: 1112.2397

Detailed view

Export this paper BibTeX - EndNote - TEI - RefWorks -

Optimal posting distance of limit orders: a stochastic algorithm approach

Sophie Laruelle 1, Charles-Albert Lehalle 2, Gilles Pagès 1

(2011-12-09)

This paper presents a stochastic recursive procedure under constraints to find the optimal distance at which an agent must post his order to minimize his execution cost. We prove the $a.s.$ convergence of the algorithm under assumptions on the cost function and give some practical criteria on model parameters to ensure that the conditions to use the algorithm are fulfilled (using notably principle of opposite monotony). We illustrate our results with numerical experiments on simulated data but also by using a financial market dataset.

1:	Laboratoire de Probabilités et Modèles Aléatoires (LPMA)
	CNRS : UMR7599 – Université Paris VI - Pierre et Marie Curie – Université Paris VII - Paris Diderot
2:	Head of Quantitative Research
	CALYON group

Subject

:

Mathematics/Probability

Keyword(s): Stochastic approximation – order book – limit order – market impact – statistical learning – high-frequency optimal liquidation – compound Poisson process – co-monotony principle

hal-00650314, version 1

http://hal.archives-ouvertes.fr/hal-00650314

oai:hal.archives-ouvertes.fr:hal-00650314

From: Sophie Laruelle <>

Submitted on: Friday, 9 December 2011 17:04:48

Updated on: Sunday, 11 December 2011 21:31:20