Volume 6, 2002
|Page(s)||1 - 19|
|Published online||15 November 2002|
Approximation of the Snell Envelope and American Options Prices in dimension one
Université du Maine,
Laboratoire Statistiques et Processus, BP. 535,
72017 Le Mans Cedex, France; email@example.com.
2 Université de Franche-Comté, Laboratoire de Mathématiques de Besançon, 16 route de Gray, 25000 Besançon, France; firstname.lastname@example.org.
Revised: 13 November 2001
We establish some error estimates for the approximation of an optimal stopping problem along the paths of the Black–Scholes model. This approximation is based on a tree method. Moreover, we give a global approximation result for the related obstacle problem.
Mathematics Subject Classification: 49L20 / 60G40 / 65M15 / 91B28
Key words: Dynamic programming / snell envelope / optimal stopping.
© EDP Sciences, SMAI, 2002
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.