Parallel American Monte Carlo
In this paper we introduce a new algorithm for American Monte Carlo that can be used either for American-style options, callable structured products or for computing counterparty credit risk (e.g. CVA or PFE computation). Leveraging least squares regressions, the main novel feature of our algorithm is that it can be fully parallelized. Moreover, there is no need to store the paths and the payoff computation can be done forwards: this allows to price structured products with complex path and exercise dependencies. The key idea of our algorithm is to split the set of paths in several subsets which are used iteratively. We give the convergence rate of the algorithm. We illustrate our method on an American put option and compare the results with the Longstaff-Schwartz algorithm.
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Doan, Viet_Dung & Gaikwad, Abhijeet & Bossy, Mireille & Baude, Françoise & Stokes-Rees, Ian, 2010. "Parallel pricing algorithms for multi-dimensional Bermudan/American options using Monte Carlo methods," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 81(3), pages 568-577.
- Barraquand, Jérôme & Martineau, Didier, 1995. "Numerical Valuation of High Dimensional Multivariate American Securities," Journal of Financial and Quantitative Analysis, Cambridge University Press, vol. 30(03), pages 383-405, September.
- Broadie, Mark & Glasserman, Paul, 1997. "Pricing American-style securities using simulation," Journal of Economic Dynamics and Control, Elsevier, vol. 21(8-9), pages 1323-1352, June.
- Lars Stentoft, 2004. "Convergence of the Least Squares Monte Carlo Approach to American Option Valuation," Management Science, INFORMS, vol. 50(9), pages 1193-1203, September.
When requesting a correction, please mention this item's handle: RePEc:arx:papers:1404.1180. 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: (arXiv administrators)
If references are entirely missing, you can add them using this form.