BZPEERPapers, people, evidence and research paths
Menu

Discover

SearchFind papers, people, topics, institutions and opportunities from one place.GraphSee how papers, authors, topics and evidence connect.

Research tools

HomeContinue from the papers, people and topics that matter now.CollectionsTurn saved papers into reading lists, evidence maps and shareable context.ResearchReconstruct the path that led you from search to paper to question.CollaborationMove from a paper, topic or expert request into a focused thread.PublishCreate full-text research articles with metadata, formulas and versions.

Network

ExpertsFind specialists whose work and reviews explain why they can help.CommunitiesJoin research groups organized around papers, topics and shared evidence.

Opportunities

ListingsBrowse roles, calls and collaborations connected to real research context.

Account

Log inReturn to your saved papers, graph views and active threads.Create accountStart saving papers, building a research trail and joining teams.
Log inCreate account

Source author record

Huyên Pham

Huyên Pham appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record
math.PRmath.OCq-fin.CPq-fin.TRMachine Learningmath.APmath.NAmath.STNeural and Evolutionary ComputingNumerical Analysisq-fin.MFq-fin.PM

Catalog footprint

What is connected

26works
12topics
4close collaborators

Actions

Connect this record

Log in to claim
Open graphBrowse works

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

26 published item(s)

preprint2026arXiv

Direct Estimation of Schrödinger Bridge Time-Series Drifts: Finite-Sample, Asymptotic, and Adaptive Guarantees

We study nonparametric estimation of Schrödinger bridge (SB) drifts from i.i.d.\ data observed on a single time interval. Starting from the conditional-ratio form of the Schrödinger bridge time-series (SBTS) drift formula, we analyze a direct Nadaraya--Watson plug-in estimator built from kernelized numerator and denominator terms. Unlike recent SB analyses based on entropic-OT potentials, Sinkhorn iterations, or iterative bridge solvers, our approach works directly at the drift level and isolates \emph{statistical error} from optimization, approximation, and discretization error. Under Hölder regularity, a marginal-density floor, and bounded support, we prove a uniform non-asymptotic bound for admissible bandwidth pairs, a pointwise CLT under genuine undersmoothing, and an adaptive bandwidth selector satisfying an oracle inequality. We also prove a pivot-local minimax lower bound which, through an explicit uniform pivot, yields a global minimax lower bound under transparent compatibility conditions; hence the adaptive selector is minimax-rate optimal up to logarithmic factors. Synthetic experiments provide theorem-targeted diagnostics for finite-sample scaling, Gaussian approximation, and adaptive behavior.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Learning Generative Dynamics with Soft Law Constraints: A McKean-Vlasov FBSDE Approach

We propose a generative framework for learning stochastic dynamics from endpoint and intermediate distributional observations. The method formulates generation as a McKean-Vlasov control problem in which terminal and time-marginal laws are enforced through soft energy constraints. The associated optimality system is a forward-backward stochastic differential equation (FBSDE) whose backward component receives a continuous drift induced by the marginal law penalties. This provides a principled alternative to hard interpolation or optimal transport maps between observed distributions: the model learns a stochastic path law whose dynamics remain globally coupled through the mean-field objective. We derive the reduced FBSDE system for quadratic control cost and constant diffusion, connecting terminal and marginal law flat derivatives to score-like training signals. The resulting neural solver is evaluated on low-dimensional distributional benchmarks, where it recovers smooth stochastic paths matching prescribed marginal laws. In a higher-dimensional ALAE latent space, endpoint supervision is used as a qualitative stress test for transporting non-smiling faces toward smiling ones in a pretrained representation. We then use articulated human motion as a structured high-dimensional case study on a curated AMASS low-to-high position dataset, using SMPL-H pose sequences and reduced pose representations. The experiments show that soft marginal law constraints can produce coherent stochastic trajectories whose intermediate distributions follow the observed evolution of human motion. The code is available at https://github.com/murex/deep-mkv-gen/tree/main.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Optimal control of McKean-Vlasov systems under partial observation and hidden Markov switching

We study a class of mean-field control problems under partial observation. The controlled dynamics are of McKean-Vlasov type and are subject to regime switching driven by a hidden Markov chain. The observation process depends on the control and on the joint distribution of the state and control, which prevents the direct application of standard filtering techniques. The main contribution of this paper is to show how this distribution dependence can be handled within a change-of-probability framework, leading to a well-posed separated control problem. We derive a Zakai equation with a specific structure for the unnormalized filter, and show that the corresponding value function satisfies a dynamic programming principle. This yields a Bellman equation posed on a convex subset of a Wasserstein space, characterizing the optimal control problem under partial observation.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

DeepSets and their derivative networks for solving symmetric PDEs

Machine learning methods for solving nonlinear partial differential equations (PDEs) are hot topical issues, and different algorithms proposed in the literature show efficient numerical approximation in high dimension. In this paper, we introduce a class of PDEs that are invariant to permutations, and called symmetric PDEs. Such problems are widespread, ranging from cosmology to quantum mechanics, and option pricing/hedging in multi-asset market with exchangeable payoff. Our main application comes actually from the particles approximation of mean-field control problems. We design deep learning algorithms based on certain types of neural networks, named PointNet and DeepSet (and their associated derivative networks), for computing simultaneously an approximation of the solution and its gradient to symmetric PDEs. We illustrate the performance and accuracy of the PointNet/DeepSet networks compared to classical feedforward ones, and provide several numerical results of our algorithm for the examples of a mean-field systemic risk, mean-variance problem and a min/max linear quadratic McKean-Vlasov control problem.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Differential learning methods for solving fully nonlinear PDEs

We propose machine learning methods for solving fully nonlinear partial differential equations (PDEs) with convex Hamiltonian. Our algorithms are conducted in two steps. First the PDE is rewritten in its dual stochastic control representation form, and the corresponding optimal feedback control is estimated using a neural network. Next, three different methods are presented to approximate the associated value function, i.e., the solution of the initial PDE, on the entire space-time domain of interest. The proposed deep learning algorithms rely on various loss functions obtained either from regression or pathwise versions of the martingale representation and its differential relation, and compute simultaneously the solution and its derivatives. Compared to existing methods, the addition of a differential loss function associated to the gradient, and augmented training sets with Malliavin derivatives of the forward process, yields a better estimation of the PDE's solution derivatives, in particular of the second derivative, which is usually difficult to approximate. Furthermore, we leverage our methods to design algorithms for solving families of PDEs when varying terminal condition (e.g. option payoff in the context of mathematical finance) by means of the class of DeepOnet neural networks aiming to approximate functional operators. Numerical tests illustrate the accuracy of our methods on the resolution of a fully nonlinear PDE associated to the pricing of options with linear market impact, and on the Merton portfolio selection problem.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Master Bellman equation in the Wasserstein space: Uniqueness of viscosity solutions

We study the Bellman equation in the Wasserstein space arising in the study of mean field control problems, namely stochastic optimal control problems for McKean-Vlasov diffusion processes.Using the standard notion of viscosity solution à la Crandall-Lions extended to our Wasserstein setting,we prove a comparison result under general conditions on the drift and reward coefficients, whichcoupled with the dynamic programming principle, implies that the value function is the unique viscosity solution of the Master Bellman equation.This is the first uniqueness result in such a second-order context. The classical arguments used in the standard cases of equations in finite-dimensional spaces or in infinite-dimensional separable Hilbert spaces do not extend to the present framework, due to the awkward nature of the underlying Wasserstein space. The adopted strategy is based on finite-dimensional approximations of the value function obtained in terms of the related cooperative $n$-player game, and on the construction of a smooth gauge-type function, built starting from a regularization of a sharp estimate of the Wasserstein metric; such a gauge-type function is used to generate maxima/minima through a suitable extension of the Borwein-Preiss generalization of Ekeland's variational principle on the Wasserstein space.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Quantitative propagation of chaos for mean field Markov decision process with common noise

We investigate propagation of chaos for mean field Markov Decision Process with common noise (CMKV-MDP), and when the optimization is performed over randomized open-loop controls on infinite horizon. We first state a rate of convergence of order $M_N^γ$, where $M_N$ is the mean rate of convergence in Wasserstein distance of the empirical measure, and $γ\in (0,1]$ is an explicit constant, in the limit of the value functions of $N$-agent control problem with asymmetric open-loop controls, towards the value function of CMKV-MDP. Furthermore, we show how to explicitly construct $(ε+\mathcal{O}(M_N^γ))$-optimal policies for the $N$-agent model from $ε$-optimal policies for the CMKV-MDP. Our approach relies on sharp comparison between the Bellman operators in the $N$-agent problem and the CMKV-MDP, and fine coupling of empirical measures.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Markowitz portfolio selection for multivariate affine and quadratic Volterra models

This paper concerns portfolio selection with multiple assets under rough covariance matrix. We investigate the continuous-time Markowitz mean-variance problem for a multivariate class of affine and quadratic Volterra models. In this incomplete non-Markovian and non-semimartingale market framework with unbounded random coefficients, the optimal portfolio strategy is expressed by means of a Riccati backward stochastic differential equation (BSDE). In the case of affine Volterra models, we derive explicit solutions to this BSDE in terms of multi-dimensional Riccati-Volterra equations. This framework includes multivariate rough Heston models and extends the results of \cite{han2019mean}. In the quadratic case, we obtain new analytic formulae for the the Riccati BSDE and we establish their link with infinite dimensional Riccati equations. This covers rough Stein-Stein and Wishart type covariance models. Numerical results on a two dimensional rough Stein-Stein model illustrate the impact of rough volatilities and stochastic correlations on the optimal Markowitz strategy. In particular for positively correlated assets, we find that the optimal strategy in our model is a `buy rough sell smooth' one.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Algorithmic trading in a microstructural limit order book model

We propose a microstructural modeling framework for studying optimal market making policies in a FIFO (first in first out) limit order book (LOB). In this context, the limit orders, market orders, and cancel orders arrivals in the LOB are modeled as Cox point processes with intensities that only depend on the state of the LOB. These are high-dimensional models which are realistic from a micro-structure point of view and have been recently developed in the literature. In this context, we consider a market maker who stands ready to buy and sell stock on a regular and continuous basis at a publicly quoted price, and identifies the strategies that maximize her P\&L penalized by her inventory. We apply the theory of Markov Decision Processes and dynamic programming method to characterize analytically the solutions to our optimal market making problem. The second part of the paper deals with the numerical aspect of the high-dimensional trading problem. We use a control randomization method combined with quantization method to compute the optimal strategies. Several computational tests are performed on simulated data to illustrate the efficiency of the computed optimal strategy. In particular, we simulated an order book with constant/ symmet-ric/ asymmetrical/ state dependent intensities, and compared the computed optimal strategy with naive strategies. Some codes are available on https://github.com/comeh.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Deep backward schemes for high-dimensional nonlinear PDEs

We propose new machine learning schemes for solving high dimensional nonlinear partial differential equations (PDEs). Relying on the classical backward stochastic differential equation (BSDE) representation of PDEs, our algorithms estimate simultaneously the solution and its gradient by deep neural networks. These approximations are performed at each time step from the minimization of loss functions defined recursively by backward induction. The methodology is extended to variational inequalities arising in optimal stopping problems. We analyze the convergence of the deep learning schemes and provide error estimates in terms of the universal approximation of neural networks. Numerical results show that our algorithms give very good results till dimension 50 (and certainly above), for both PDEs and variational inequalities problems. For the PDEs resolution, our results are very similar to those obtained by the recent method in \cite{weinan2017deep} when the latter converges to the right solution or does not diverge. Numerical tests indicate that the proposed methods are not stuck in poor local minimaas it can be the case with the algorithm designed in \cite{weinan2017deep}, and no divergence is experienced. The only limitation seems to be due to the inability of the considered deep neural networks to represent a solution with a too complex structure in high dimension.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Mean-variance portfolio selection with tracking error penalization

This paper studies a variation of the continuous-time mean-variance portfolio selection where a tracking-error penalization is added to the mean-variance criterion. The tracking error term penalizes the distance between the allocation controls and a reference portfolio with same wealth and fixed weights. Such consideration is motivated as follows: (i) On the one hand, it is a way to robustify the mean-variance allocation in case of misspecified parameters, by "fitting" it to a reference portfolio that can be agnostic to market parameters; (ii) On the other hand, it is a procedure to track a benchmark and improve the Sharpe ratio of the resulting portfolio by considering a mean-variance criterion in the objective function. This problem is formulated as a McKean-Vlasov control problem. We provide explicit solutions for the optimal portfolio strategy and asymptotic expansions of the portfolio strategy and efficient frontier for small values of the tracking error parameter. Finally, we compare the Sharpe ratios obtained by the standard mean-variance allocation and the penalized one for four different reference portfolios: equal-weights, minimum-variance, equal risk contributions and shrinking portfolio. This comparison is done on a simulated misspecified model, and on a backtest performed with historical data. Our results show that in most cases, the penalized portfolio outperforms in terms of Sharpe ratio both the standard mean-variance and the reference portfolio.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Randomization method and backward SDEs for optimal control of partially observed path-dependent stochastic systems

We consider a unifying framework for stochastic control problem including the following features: partial observation, path-dependence (both with respect to the state and the control), and without any non-degeneracy condition on the stochastic differential equation (SDE) for the controlled state process, driven by a Wiener process. In this context, we develop a general methodology, refereed to as the randomization method, studied in [23] for classical Markovian control under full observation, and consisting basically in replacing the control by an exogenous process independent of the driving noise of the SDE. Our first main result is to prove the equivalence between the primal control problem and the randomized control problem where optimization is performed over change of equivalent probability measures affecting the characteristics of the exogenous process. The randomized problem turns out to be associated by duality and separation argument to a backward SDE, which leads to the so-called randomized dynamic programming principle and randomized equation in terms of the path-dependent filter, and then characterizes the value function of the primal problem. In particular, classical optimal control problems with partial observation affected by non-degenerate Gaussian noise fall within the scope of our framework, and are treated by means of an associated backward SDE.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Randomized dynamic programming principle and Feynman-Kac representation for optimal control of McKean-Vlasov dynamics

We analyze a stochastic optimal control problem, where the state process follows a McKean-Vlasov dynamics and the diffusion coefficient can be degenerate. We prove that its value function V admits a nonlinear Feynman-Kac representation in terms of a class of forward-backward stochastic differential equations, with an autonomous forward process. We exploit this probabilistic representation to rigorously prove the dynamic programming principle (DPP) for V. The Feynman-Kac representation we obtain has an important role beyond its intermediary role in obtaining our main result: in fact it would be useful in developing probabilistic numerical schemes for V. The DPP is important in obtaining a characterization of the value function as a solution of a non-linear partial differential equation (the so-called Hamilton-Jacobi-Belman equation), in this case on the Wasserstein space of measures. We should note that the usual way of solving these equations is through the Pontryagin maximum principle, which requires some convexity assumptions. There were attempts in using the dynamic programming approach before, but these works assumed a priori that the controls were of Markovian feedback type, which helps write the problem only in terms of the distribution of the state process (and the control problem becomes a deterministic problem). In this paper, we will consider open-loop controls and derive the dynamic programming principle in this most general case. In order to obtain the Feynman-Kac representation and the randomized dynamic programming principle, we implement the so-called randomization method, which consists in formulating a new McKean-Vlasov control problem, expressed in weak form taking the supremum over a family of equivalent probability measures. One of the main results of the paper is the proof that this latter control problem has the same value function V of the original control problem.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Randomized filtering and Bellman equation in Wasserstein space for partial observation control problem

We study a stochastic optimal control problem for a partially observed diffusion. By using the control randomization method in [4], we prove a corresponding randomized dynamic programming principle (DPP) for the value function, which is obtained from a flow property of an associated filter process. This DPP is the key step towards our main result: a characterization of the value function of the partial observation control problem as the unique viscosity solution to the corresponding dynamic programming Hamilton-Jacobi-Bellman (HJB) equation. The latter is formulated as a new, fully non linear partial differential equation on the Wasserstein space of probability measures. An important feature of our approach is that it does not require any non-degeneracy condition on the diffusion coefficient, and no condition is imposed to guarantee existence of a density for the filter process solution to the controlled Zakai equation, as usually done for the separated problem. Finally, we give an explicit solution to our HJB equation in the case of a partially observed non Gaussian linear quadratic model.

0 citations0 reviewsNo code linkedOpen access
preprint2015arXiv

Discrete time McKean-Vlasov control problem: a dynamic programming approach

We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate linear-quadratic McKean-Vlasov control problem.

0 citations0 reviewsNo code linkedOpen access
preprint2015arXiv

Feynman-Kac representation for Hamilton-Jacobi-Bellman IPDE

We aim to provide a Feynman-Kac type representation for Hamilton-Jacobi-Bellman equation, in terms of forward backward stochastic differential equation (FBSDE) with a simulatable forward process. For this purpose, we introduce a class of BSDE where the jumps component of the solution is subject to a partial nonpositive constraint. Existence and approximation of a unique minimal solution is proved by a penalization method under mild assumptions. We then show how minimal solution to this BSDE class provides a new probabilistic representation for nonlinear integro-partial differential equations (IPDEs) of Hamilton-Jacobi-Bellman (HJB) type, when considering a regime switching forward SDE in a Markovian framework, and importantly we do not make any ellipticity condition. Moreover, we state a dual formula of this BSDE minimal solution involving equivalent change of probability measures. This gives in particular an original representation for value functions of stochastic control problems including controlled diffusion coefficient.

0 citations0 reviewsNo code linkedOpen access
preprint2015arXiv

High frequency trading and asymptotics for small risk aversion in a Markov renewal model

We study a an optimal high frequency trading problem within a market microstructure model designed to be a good compromise between accuracy and tractability. The stock price is driven by a Markov Renewal Process (MRP), while market orders arrive in the limit order book via a point process correlated with the stock price itself. In this framework, we can reproduce the adverse selection risk, appearing in two different forms: the usual one due to big market orders impacting the stock price and penalizing the agent, and the weak one due to small market orders and reducing the probability of a profitable execution. We solve the market making problem by stochastic control techniques in this semi-Markov model. In the no risk-aversion case, we provide explicit formula for the optimal controls and characterize the value function as a simple linear PDE. In the general case, we derive the optimal controls and the value function in terms of the previous result, and illustrate how the risk aversion influences the trader strategy and her expected gain. Finally, by using a perturbation method, approximate optimal controls for small risk aversions are explicitly computed in terms of two simple PDE's, reducing drastically the computational cost and enlightening the financial interpretation of the results.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

Explicit investment rules with time-to-build and uncertainty

We establish explicit socially optimal rules for an irreversible investment deci- sion with time-to-build and uncertainty. Assuming a price sensitive demand function with a random intercept, we provide comparative statics and economic interpreta- tions for three models of demand (arithmetic Brownian, geometric Brownian, and the Cox-Ingersoll-Ross). Committed capacity, that is, the installed capacity plus the in- vestment in the pipeline, must never drop below the best predictor of future demand, minus two biases. The discounting bias takes into account the fact that investment is paid upfront for future use; the precautionary bias multiplies a type of risk aversion index by the local volatility. Relying on the analytical forms, we discuss in detail the economic effects.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

Dual and backward SDE representation for optimal control of non-Markovian SDEs

We study optimal stochastic control problem for non-Markovian stochastic differential equations (SDEs) where the drift, diffusion coefficients, and gain functionals are path-dependent, and importantly we do not make any ellipticity assumption on the SDE. We develop a controls randomization approach, and prove that the value function can be reformulated under a family of dominated measures on an enlarged filtered probability space. This value function is then characterized by a backward SDE with nonpositive jumps under a single probability measure, which can be viewed as a path-dependent version of the Hamilton-Jacobi-Bellman equation, and an extension to $G$ expectation.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

Optimal investment under multiple defaults risk: A BSDE-decomposition approach

We study an optimal investment problem under contagion risk in a financial model subject to multiple jumps and defaults. The global market information is formulated as a progressive enlargement of a default-free Brownian filtration, and the dependence of default times is modeled by a conditional density hypothesis. In this Ito-jump process model, we give a decomposition of the corresponding stochastic control problem into stochastic control problems in the default-free filtration, which are determined in a backward induction. The dynamic programming method leads to a backward recursive system of quadratic backward stochastic differential equations (BSDEs) in Brownian filtration, and our main result proves, under fairly general conditions, the existence and uniqueness of a solution to this system, which characterizes explicitly the value function and optimal strategies to the optimal investment problem. We illustrate our solutions approach with some numerical tests emphasizing the impact of default intensities, loss or gain at defaults and correlation between assets. Beyond the financial problem, our decomposition approach provides a new perspective for solving quadratic BSDEs with a finite number of jumps.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

Semi Markov model for market microstructure

We introduce a new model for describing the fluctuations of a tick-by-tick single asset price. Our model is based on Markov renewal processes. We consider a point process associated to the timestamps of the price jumps, and marks associated to price increments. By modeling the marks with a suitable Markov chain, we can reproduce the strong mean-reversion of price returns known as microstructure noise. Moreover, by using Markov renewal processes, we can model the presence of spikes in intensity of market activity, i.e. the volatility clustering, and consider dependence between price increments and jump times. We also provide simple parametric and nonparametric statistical procedures for the estimation of our model. We obtain closed-form formula for the mean signature plot, and show the diffusive behavior of our model at large scale limit. We illustrate our results by numerical simulations, and that our model is consistent with empirical data on the Euribor future.

0 citations0 reviewsNo code linkedOpen access
preprint2012arXiv

Investment/consumption problem in illiquid markets with regime-switching

We consider an illiquid financial market with different regimes modeled by a continuous-time finite-state Markov chain. The investor can trade a stock only at the discrete arrival times of a Cox process with intensity depending on the market regime. Moreover, the risky asset price is subject to liquidity shocks, which change its rate of return and volatility, and induce jumps on its dynamics. In this setting, we study the problem of an economic agent optimizing her expected utility from consumption under a non-bankruptcy constraint. By using the dynamic programming method, we provide the characterization of the value function of this stochastic control problem in terms of the unique viscosity solution to a system of integro-partial differential equations. We next focus on the popular case of CRRA utility functions, for which we can prove smoothness $C^2$ results for the value function. As an important byproduct, this allows us to get the existence of optimal investment/consumption strategies characterized in feedback forms. We analyze a convergent numerical scheme for the resolution to our stochastic control problem, and we illustrate finally with some numerical experiments the effects of liquidity regimes in the investor's optimal decision.

0 citations0 reviewsNo code linkedOpen access
preprint2012arXiv

Optimal High Frequency Trading in a Pro-Rata Microstructure with Predictive Information

We propose a framework to study optimal trading policies in a one-tick pro-rata limit order book, as typically arises in short-term interest rate futures contracts. The high-frequency trader has the choice to trade via market orders or limit orders, which are represented respectively by impulse controls and regular controls. We model and discuss the consequences of the two main features of this particular microstructure: first, the limit orders sent by the high frequency trader are only partially executed, and therefore she has no control on the executed quantity. For this purpose, cumulative executed volumes are modelled by compound Poisson processes. Second, the high frequency trader faces the overtrading risk, which is the risk of brutal variations in her inventory. The consequences of this risk are investigated in the context of optimal liquidation. The optimal trading problem is studied by stochastic control and dynamic programming methods, which lead to a characterization of the value function in terms of an integro quasi-variational inequality. We then provide the associated numerical resolution procedure, and convergence of this computational scheme is proved. Next, we examine several situations where we can on one hand simplify the numerical procedure by reducing the number of state variables, and on the other hand focus on specific cases of practical interest. We examine both a market making problem and a best execution problem in the case where the mid-price process is a martingale. We also detail a high frequency trading strategy in the case where a (predictive) directional information on the mid-price is available. Each of the resulting strategies are illustrated by numerical tests.

0 citations0 reviewsNo code linkedOpen access
preprint2012arXiv

Time discretization and quantization methods for optimal multiple switching problem

In this paper, we study probabilistic numerical methods based on optimal quantization algorithms for computing the solution to optimal multiple switching problems with regime-dependent state process. We first consider a discrete-time approximation of the optimal switching problem, and analyze its rate of convergence. Given a time step $h$, the error is in general of order $(h \log(1/h))^{1/2}$, and of order $h^{1/2}$ when the switching costs do not depend on the state process. We next propose quantization numerical schemes for the space discretization of the discrete-time Euler state process. A Markovian quantization approach relying on the optimal quantization of the normal distribution arising in the Euler scheme is analyzed. In the particular case of uncontrolled state process, we describe an alternative marginal quantization method, which extends the recursive algorithm for optimal stopping problems as in Bally-Pagès (2003). A priori $L^p$-error estimates are stated in terms of quantization errors. Finally, some numerical tests are performed for an optimal switching problem with two regimes.

0 citations0 reviewsNo code linkedOpen access
preprint2011arXiv

Swing Options Valuation: a BSDE with Constrained Jumps Approach

We introduce a new probabilistic method for solving a class of impulse control problems based on their representations as Backward Stochastic Differential Equations (BSDEs for short) with constrained jumps. As an example, our method is used for pricing Swing options. We deal with the jump constraint by a penalization procedure and apply a discrete-time backward scheme to the resulting penalized BSDE with jumps. We study the convergence of this numerical method, with respect to the main approximation parameters: the jump intensity $λ$, the penalization parameter $p > 0$ and the time step. In particular, we obtain a convergence rate of the error due to penalization of order $(λp)^{α- \frac{1}{2}}, \forall α\in \left(0, \frac{1}{2}\right)$. Combining this approach with Monte Carlo techniques, we then work out the valuation problem of (normalized) Swing options in the Black and Scholes framework. We present numerical tests and compare our results with a classical iteration method.

0 citations0 reviewsNo code linkedOpen access
preprint2010arXiv

Backward SDEs with constrained jumps and quasi-variational inequalities

We consider a class of backward stochastic differential equations (BSDEs) driven by Brownian motion and Poisson random measure, and subject to constraints on the jump component. We prove the existence and uniqueness of the minimal solution for the BSDEs by using a penalization approach. Moreover, we show that under mild conditions the minimal solutions to these constrained BSDEs can be characterized as the unique viscosity solution of quasi-variational inequalities (QVIs), which leads to a probabilistic representation for solutions to QVIs. Such a representation in particular gives a new stochastic formula for value functions of a class of impulse control problems. As a direct consequence, this suggests a numerical scheme for the solution of such QVIs via the simulation of the penalized BSDEs.

0 citations0 reviewsNo code linkedOpen access