Search

We derive Wasserstein distance bounds between the probability distributions of a stochastic integral (Itô) process with jumps (X t) t ∈ [ 0 , T ] and a jump-diffusion process (X t ∗) t ∈ [ 0 , T ] . Our bounds are expressed using the stochastic characteristics of (X t) t ∈ [ 0 , T ] and the jump-diffusion coefficients of (X t ∗) t ∈ [ 0 , T ] evaluated in X t , and apply in particular to the case of different jump characteristics. Our approach uses stochastic calculus arguments and L p integrability results for the flow of stochastic differential equations with jumps, without relying on the Stein equation. [ABSTRACT FROM AUTHOR]

We extend the construction of equilibria for linear-quadratic and mean-variance portfolio problems available in the literature to a large class of mean-field time-inconsistent stochastic control problems in continuous time. Our approach relies on a time discretization of the control problem via n-person games, which are characterized via the maximum principle using backward stochastic differential equations. The existence of equilibria is proved by applying weak convergence arguments to the solutions of n-person games. A numerical implementation is provided by approximating n-person games using finite Markov chains. [ABSTRACT FROM AUTHOR]

We derive a characterization of equilibrium controls in continuous-time, time-inconsistent control (TIC) problems using the Malliavin calculus. For this, the classical duality analysis of adjoint BSDEs is replaced with the Malliavin integration by parts. This results into a necessary and sufficient maximum principle which is applied to a linear-quadratic TIC problem, recovering previous results obtained by duality analysis in the mean-variance case, and extending them to the linear-quadratic setting. We also show that our results apply beyond the linear-quadratic case by treating the generalized Merton problem. [ABSTRACT FROM AUTHOR]

We present a multidimensional deep learning implementation of a stochastic branching algorithm for the numerical solution of fully nonlinear PDEs. This approach is designed to tackle functional nonlinearities involving gradient terms of any orders, by combining the use of neural networks with a Monte Carlo branching algorithm. In comparison with other deep learning PDE solvers, it also allows us to check the consistency of the learned neural network function. Numerical experiments presented show that this algorithm can outperform deep learning approaches based on backward stochastic differential equations or the Galerkin method, and provide solution estimates that are not obtained by those methods in fully nonlinear examples. [ABSTRACT FROM AUTHOR]