Recombining Tree Approximations for Optimal Stopping for Diffusions
classification
🧮 math.PR
keywords
optimalstoppingapproximationsconstructdiffusionsmethodsrecombiningtree
pith:VAEDG7G5 Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{VAEDG7G5}
Prints a linked pith:VAEDG7G5 badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original 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
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.