A dynamic look-ahead Monte Carlo algorithm for pricing Bermudan options

From MaRDI portal
Publication:2467599

DOI10.1214/105051607000000249zbMATH Open1136.91010arXiv0710.3640OpenAlexW2019703483MaRDI QIDQ2467599FDOQ2467599


Authors: Daniel Egloff, Michael Kohler, Nebojsa Todorovic Edit this on Wikidata


Publication date: 28 January 2008

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: Under the assumption of no-arbitrage, the pricing of American and Bermudan options can be casted into optimal stopping problems. We propose a new adaptive simulation based algorithm for the numerical solution of optimal stopping problems in discrete time. Our approach is to recursively compute the so-called continuation values. They are defined as regression functions of the cash flow, which would occur over a series of subsequent time periods, if the approximated optimal exercise strategy is applied. We use nonparametric least squares regression estimates to approximate the continuation values from a set of sample paths which we simulate from the underlying stochastic process. The parameters of the regression estimates and the regression problems are chosen in a data-dependent manner. We present results concerning the consistency and rate of convergence of the new algorithm. Finally, we illustrate its performance by pricing high-dimensional Bermudan basket options with strangle-spread payoff based on the average of the underlying assets.


Full work available at URL: https://arxiv.org/abs/0710.3640




Recommendations



Cites Work


Cited In (39)





This page was built for publication: A dynamic look-ahead Monte Carlo algorithm for pricing Bermudan options

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467599)