We present an iterative procedure for computing the optimal Bermudan stopping time, hence the Bermudan Snell envelope. The method produces an increasing sequence of approximations of the Snell envelope from below, which coincide with the Snell envelope after finitely many steps. Then, by...

In this article we propose a novel approach to reduce the computational complexity of the dual method for pricing American options. We consider a sequence of martingales that converges to a given target martingale and decompose the original dual representation into a sum of representations that...

Motivated by the challenges related to the calibration of financial models, we consider the problem of numerically solving a singular McKean–Vlasov equation dXt=σ(t,Xt)XtvtE[vt

In this work, we consider optimal stopping problems with model uncertainty incorporated into the formulation of the underlying objective function. Typically, the robust, efficient hedging of American options in incomplete markets may be described as optimal stopping of such kind. Based on a...