We present a new non-nested approach for computing additive upper bounds for callable derivatives using Monte Carlo simulation. It relies on the regression of Greeks computed using adjoint methods. We also show that it is possible to early terminate paths once points of optimal exercise have...

In many of the numerical methods for pricing American options based on the dynamic programming approach, the most computationally intensive part can be formulated as the summation of Gaussians. Though this operation usually requiresO(NN') work when there areN' summations to compute and the...

This paper analyses the robustness of Least-Squares Monte Carlo, a technique recently proposed by Longstaff and Schwartz (2001) for pricing American options. This method is based on least-squares regressions in which the explanatory variables are certain polynomial functions. We analyze the...

This paper analyses the robustness of Least-Squares Monte Carlo, a technique proposed by Longstaff and Schwartz (2001) for pricing American options. This method is based on least-squares regressions in which the explanatory variables are certain polynomial functions. We analyze the impact of...