2000 character limit reached
Recombining Tree Approximations for Optimal Stopping for Diffusions
Published 3 Oct 2016 in math.PR | (1610.00554v3)
Abstract: 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
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.