• 10 January 2019
    • preprint
    • Published by HAL in HAL
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.
All Related Versions

This publication has 19 references indexed in Scilit: