Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/233754 
Erscheinungsjahr: 
2020
Quellenangabe: 
[Journal:] Mathematical Finance [ISSN:] 1467-9965 [Volume:] 30 [Issue:] 4 [Publisher:] Wiley [Place:] Hoboken, NJ [Year:] 2020 [Pages:] 1591-1616
Verlag: 
Wiley, Hoboken, NJ
Zusammenfassung: 
In this paper, we propose a Weighted Stochastic Mesh (WSM) algorithm for approximating the value of discrete- and continuous-time optimal stopping problems. In this context, we consider tractability of such problems via a useful notion of semitractability and the introduction of a tractability index for a particular numerical solution algorithm. It is shown that in the discrete-time case the WSM algorithm leads to semitractability of the corresponding optimal stopping problem in the sense that its complexity is bounded in order by ε−4logd+2(1/ε) with d being the dimension of the underlying Markov chain. Furthermore, we study the WSM approach in the context of continuous-time optimal stopping problems and derive the corresponding complexity bounds. Although we cannot prove semitractability in this case, our bounds turn out to be the tightest ones among the complexity bounds known in the literature. We illustrate our theoretical findings by a numerical example.
Schlagwörter: 
American options
complexity
Monte Carlo algorithms
optimal stopping
Persistent Identifier der Erstveröffentlichung: 
Creative-Commons-Lizenz: 
cc-by Logo
Dokumentart: 
Article
Dokumentversion: 
Published Version

Datei(en):
Datei
Größe
514.73 kB





Publikationen in EconStor sind urheberrechtlich geschützt.