arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1610.00554math.PR
收藏

扩散问题最优停止的二叉树逼近

Recombining Tree Approximations for Optimal Stopping for Diffusions

Erhan Bayraktar, Yan Dolinsky, Jia Guo

摘要:

在本文中,我们发展了两个数值方法的最佳停止在一维扩散的框架。这两种方法都使用Skorohod嵌入,以构建重组树近似一般系数的扩散。这种技术使我们能够确定收敛速度,并构建几乎最佳的停时,这是最佳的在相同的速度。最后,我们在几个模型上证明了我们方案的有效性

英文摘要:

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

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑