Sequential design for optimal stopping problems

From MaRDI portal
Publication:2941479

DOI10.1137/140980089zbMATH Open1320.91154arXiv1309.3832OpenAlexW3099636734MaRDI QIDQ2941479FDOQ2941479


Authors: Robert B. Gramacy, Michael Ludkovski Edit this on Wikidata


Publication date: 28 August 2015

Published in: SIAM Journal on Financial Mathematics (Search for Journal in Brave)

Abstract: We propose a new approach to solve optimal stopping problems via simulation. Working within the backward dynamic programming/Snell envelope framework, we augment the methodology of Longstaff-Schwartz that focuses on approximating the stopping strategy. Namely, we introduce adaptive generation of the stochastic grids anchoring the simulated sample paths of the underlying state process. This allows for active learning of the classifiers partitioning the state space into the continuation and stopping regions. To this end, we examine sequential design schemes that adaptively place new design points close to the stopping boundaries. We then discuss dynamic regression algorithms that can implement such recursive estimation and local refinement of the classifiers. The new algorithm is illustrated with a variety of numerical experiments, showing that an order of magnitude savings in terms of design size can be achieved. We also compare with existing benchmarks in the context of pricing multi-dimensional Bermudan options.


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




Recommendations




Cites Work


Cited In (16)

Uses Software





This page was built for publication: Sequential design for optimal stopping problems

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