arXiv subjects

Charles-Albert Lehalle

Publications and source records attributed to Charles-Albert Lehalle.

29 records · Page 2Linked to original sources

arXiv2015

How to predict the consequences of a tick value change? Evidence from the Tokyo Stock Exchange pilot program

The tick value is a crucial component of market design and is often considered the most suitable tool to mitigate the effects of high frequency trading. The goal of this paper is to demonstrate that the approach introduced in Dayri and Rosenbaum (2015) allows for an ex ante assessment of the consequences of a tick value change on the microstructure of an asset. To that purpose, we analyze the pilot program on tick value modifications started in 2014 by the Tokyo Stock Exchange in light of this methodology. We focus on forecasting the future cost of market and limit orders after a tick value change and show that our predictions are very accurate. Furthermore, for each asset involved in the pilot program, we are able to define (ex ante) an optimal tick value. This enables us to classify the stocks according to the relevance of their tick value, before and after its modification.

q-fin.TR↗

arXiv2014

Market impacts and the life cycle of investors orders

In this paper, we use a database of around 400,000 metaorders issued by investors and electronically traded on European markets in 2010 in order to study market impact at different scales. At the intraday scale we confirm a square root temporary impact in the daily participation, and we shed light on a duration factor in $1/T^γ$ with $γ\simeq 0.25$. Including this factor in the fits reinforces the square root shape of impact. We observe a power-law for the transient impact with an exponent between $0.5$ (for long metaorders) and $0.8$ (for shorter ones). Moreover we show that the market does not anticipate the size of the meta-orders. The intraday decay seems to exhibit two regimes (though hard to identify precisely): a "slow" regime right after the execution of the meta-order followed by a faster one. At the daily time scale, we show price moves after a metaorder can be split between realizations of expected returns that have triggered the investing decision and an idiosynchratic impact that slowly decays to zero. Moreover we propose a class of toy models based on Hawkes processes (the Hawkes Impact Models, HIM) to illustrate our reasoning. We show how the Impulsive-HIM model, despite its simplicity, embeds appealing features like transience and decay of impact. The latter is parametrized by a parameter $C$ having a macroscopic interpretation: the ratio of contrarian reaction (i.e. impact decay) and of the "herding" reaction (i.e. impact amplification).

q-fin.TR↗

arXiv2014

Simulating and analyzing order book data: The queue-reactive model

Through the analysis of a dataset of ultra high frequency order book updates, we introduce a model which accommodates the empirical properties of the full order book together with the stylized facts of lower frequency financial data. To do so, we split the time interval of interest into periods in which a well chosen reference price, typically the mid price, remains constant. Within these periods, we view the limit order book as a Markov queuing system. Indeed, we assume that the intensities of the order flows only depend on the current state of the order book. We establish the limiting behavior of this model and estimate its parameters from market data. Then, in order to design a relevant model for the whole period of interest, we use a stochastic mechanism that allows for switches from one period of constant reference price to another. Beyond enabling to reproduce accurately the behavior of market data, we show that our framework can be very useful for practitioners, notably as a market simulator or as a tool for the transaction cost analysis of complex trading algorithms.

q-fin.TR↗

arXiv2013

Optimal starting times, stopping times and risk measures for algorithmic trading: Target Close and Implementation Shortfall

We derive explicit recursive formulas for Target Close (TC) and Implementation Shortfall (IS) in the Almgren-Chriss framework. We explain how to compute the optimal starting and stopping times for IS and TC, respectively, given a minimum trading size. We also show how to add a minimum participation rate constraint (Percentage of Volume, PVol) for both TC and IS. We also study an alternative set of risk measures for the optimisation of algorithmic trading curves. We assume a self-similar process (e.g. Levy process, fractional Brownian motion or fractal process) and define a new risk measure, the p-variation, which reduces to the variance if the process is a brownian motion. We deduce the explicit formula for the TC and IS algorithms under a self-similar process. We show that there is an equivalence between selfsimilar models and a family of risk measures called p-variations: assuming a self-similar process and calibrating empirically the parameter p for the p-variation yields the same result as assuming a Brownian motion and using the p-variation as risk measure instead of the variance. We also show that p can be seen as a measure of the aggressiveness: p increases if and only if the TC algorithm starts later and executes faster. Finally, we show how the parameter p of the p-variation can be implied from the optimal starting time of TC, and that under this framework p can be viewed as a measure of the joint impact of market impact (i.e. liquidity) and volatility.

q-fin.TR↗

arXiv2013

General Intensity Shapes in Optimal Liquidation

The classical literature on optimal liquidation, rooted in Almgren-Chriss models, tackles the optimal liquidation problem using a trade-off between market impact and price risk. Therefore, it only answers the general question of the optimal liquidation rhythm. The very question of the actual way to proceed with liquidation is then rarely dealt with. Our model, that incorporates both price risk and non-execution risk, is an attempt to tackle this question using limit orders. The very general framework we propose to model liquidation generalizes the existing literature on optimal posting of limit orders. We consider a risk-adverse agent whereas the model of Bayraktar and Ludkovski only tackles the case of a risk-neutral one. We consider very general functional forms for the execution process intensity, whereas Guéant et al. is restricted to exponential intensity. Eventually, we link the execution cost function of Almgren-Chriss models to the intensity function in our model, providing then a way to see Almgren-Chriss models as a limit of ours.

q-fin.TR↗

arXiv2013

Realtime market microstructure analysis: online Transaction Cost Analysis

Motivated by the practical challenge in monitoring the performance of a large number of algorithmic trading orders, this paper provides a methodology that leads to automatic discovery of the causes that lie behind a poor trading performance. It also gives theoretical foundations to a generic framework for real-time trading analysis. Academic literature provides different ways to formalize these algorithms and show how optimal they can be from a mean-variance, a stochastic control, an impulse control or a statistical learning viewpoint. This paper is agnostic about the way the algorithm has been built and provides a theoretical formalism to identify in real-time the market conditions that influenced its efficiency or inefficiency. For a given set of characteristics describing the market context, selected by a practitioner, we first show how a set of additional derived explanatory factors, called anomaly detectors, can be created for each market order. We then will present an online methodology to quantify how this extended set of factors, at any given time, predicts which of the orders are underperforming while calculating the predictive power of this explanatory factor set. Armed with this information, which we call influence analysis, we intend to empower the order monitoring user to take appropriate action on any affected orders by re-calibrating the trading algorithms working the order through new parameters, pausing their execution or taking over more direct trading control. Also we intend that use of this method in the post trade analysis of algorithms can be taken advantage of to automatically adjust their trading action.

q-fin.TR↗

arXiv2013

Market Microstructure Knowledge Needed for Controlling an Intra-Day Trading Process

A great deal of academic and theoretical work has been dedicated to optimal liquidation of large orders these last twenty years. The optimal split of an order through time (`optimal trade scheduling') and space (`smart order routing') is of high interest \rred{to} practitioners because of the increasing complexity of the market micro structure because of the evolution recently of regulations and liquidity worldwide. This paper translates into quantitative terms these regulatory issues and, more broadly, current market design. It relates the recent advances in optimal trading, order-book simulation and optimal liquidity to the reality of trading in an emerging global network of liquidity.

q-fin.TR↗

arXiv2012

Optimal posting price of limit orders: learning by trading

Considering that a trader or a trading algorithm interacting with markets during continuous auctions can be modeled by an iterating procedure adjusting the price at which he posts orders at a given rhythm, this paper proposes a procedure minimizing his costs. 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 the co-monotony principle). We illustrate our results with numerical experiments on both simulated data and using a financial market dataset.

q-fin.TR↗

arXiv2012

Dealing with the Inventory Risk. A solution to the market making problem

Market makers continuously set bid and ask quotes for the stocks they have under consideration. Hence they face a complex optimization problem in which their return, based on the bid-ask spread they quote and the frequency at which they indeed provide liquidity, is challenged by the price risk they bear due to their inventory. In this paper, we consider a stochastic control problem similar to the one introduced by Ho and Stoll and formalized mathematically by Avellaneda and Stoikov. The market is modeled using a reference price $S_t$ following a Brownian motion with standard deviation $σ$, arrival rates of buy or sell liquidity-consuming orders depend on the distance to the reference price $S_t$ and a market maker maximizes the expected utility of its P&L over a finite time horizon. We show that the Hamilton-Jacobi-Bellman equations associated to the stochastic optimal control problem can be transformed into a system of linear ordinary differential equations and we solve the market making problem under inventory constraints. We also shed light on the asymptotic behavior of the optimal quotes and propose closed-form approximations based on a spectral characterization of the optimal quotes.

q-fin.TR↗

arXiv2012

Optimal Portfolio Liquidation with Limit Orders

This paper addresses the optimal scheduling of the liquidation of a portfolio using a new angle. Instead of focusing only on the scheduling aspect like Almgren and Chriss, or only on the liquidity-consuming orders like Obizhaeva and Wang, we link the optimal trade-schedule to the price of the limit orders that have to be sent to the limit order book to optimally liquidate a portfolio. Most practitioners address these two issues separately: they compute an optimal trading curve and they then send orders to the markets to try to follow it. The results obtained here solve simultaneously the two problems. As in a previous paper that solved the "intra-day market making problem", the interactions of limit orders with the market are modeled via a Poisson process pegged to a diffusive "fair price" and a Hamilton-Jacobi-Bellman equation is used to solve the problem involving both non-execution risk and price risk. Backtests are carried out to exemplify the use of our results, both on long periods of time (for the entire liquidation process) and on slices of 5 minutes (to follow a given trading curve).

q-fin.TR↗

arXiv2010

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

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.

q-fin.TR↗