We present a new non-nested approach to 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 is possible to early terminate paths once points of optimal exercise have...

We investigate the pricing performance of eight trinomial trees and one binomial tree, which was found to be most effective in an earlier paper, under twenty different implementation methodologies for pricing American put options. We conclude that the binomial tree, the Tian third order moment...

We introduce a set of improvements which allow the calculation of very tight lower bounds for Bermudan derivatives using Monte Carlo simulation. These lower bounds can be computed quickly, and with minimal hand-crafting. Our focus is on accelerating policy iteration to the point where it can be...