Simulation of McKean-Vlasov BSDEs by Wiener chaos expansion
Preprint
Abstract
We present an algorithm to solve McKean-Vlasov BSDEs based on Wiener chaos expansion and Picard's iterations and study its convergence. This paper extends the results obtained by Briand and Labart in [BL14] when standard BSDEs were considered. Here we are faced with the problem of the approximation of the law of (Y, Z) in the driver, that we solve by using a particle system. In order to avoid solving a system of BSDEs, which would not be feasible in practice, we use the same particles to approximate the law of (Y, Z) and to compute Monte Carlo approximations. This leads to an algorithm which doesn't cost more than the standard one.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Cubature method to solve BSDEs: Error expansion and complexity controlMathematics of Computation, 2020
- Rate of convergence for the discrete-time approximation of reflected BSDEs arising in switching problemsStochastic Processes and their Applications, 2019
- Numerical Stability Analysis of the Euler Scheme for BSDEsSIAM Journal on Numerical Analysis, 2015
- On the rate of convergence in Wasserstein distance of the empirical measureProbability Theory and Related Fields, 2014
- Linear Multistep Schemes for BSDEsSIAM Journal on Numerical Analysis, 2014
- Mean-field backward stochastic differential equations: A limit approachThe Annals of Probability, 2009
- Time discretization and Markovian iteration for coupled FBSDEsThe Annals of Applied Probability, 2008
- A regression-based Monte Carlo method to solve backward stochastic differential equationsThe Annals of Applied Probability, 2005
- Adapted solution of a backward stochastic differential equationSystems & Control Letters, 1990
- Conjugate convex functions in optimal stochastic controlJournal of Mathematical Analysis and Applications, 1973