Smart Monte Carlo: Various tricks using Malliavin calculus
Current Monte Carlo pricing engines may face computational challenge for the Greeks, because of not only their time consumption but also their poor convergence when using a finite difference estimate with a brute force perturbation. The same story may apply to conditional expectation. In this short paper, following Fournié et al. (1999), we explain how to tackle this issue using Malliavin calculus to smoothen the payoff to estimate. We discuss the relationship with the likelihood ration method of Broadie and Glasserman (1996). We show on numerical results the efficiency of this method and discuss when it is appropriate or not to use it. We see how to apply this method to the Heston model.
When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpfi:0212004. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (EconWPA)
If references are entirely missing, you can add them using this form.