Recombining Tree Approximations for Optimal Stopping for Diffusions

In this paper we develop two numerical methods for optimal stopping in the framework of one dimensional diffusion. Both of the methods use the Skorohod embedding in order to construct recombining tree approximations for diffusions with general coefficients. This technique allows us to determine convergence rates and construct nearly optimal stopping times which are optimal at the same rate. Finally, we demonstrate the efficiency of our schemes on several models

MoreLess

Year of publication:	2017
Authors:	Bayraktar, Erhan
Other Persons:	Dolinsky, Yan (contributor) ; Guo, Jia (contributor)
Publisher:	[2017]: [S.l.] : SSRN
Subject:	Suchtheorie \| Search theory \| Optionspreistheorie \| Option pricing theory \| Stochastischer Prozess \| Stochastic process

freely available

Full text |

More access options

doi.org

Check Google Scholar

In German libraries (KVK)

I need help

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10012962050