Milstein布朗桥蒙特卡罗方法的收敛性和稳定Greeks计算
Convergence of Milstein Brownian bridge Monte Carlo methods and stable Greeks calculation
摘要:
我们考虑了连续监控障碍期权的定价和敏感性计算。标准蒙特卡罗算法可以很好地为这些期权定价。因此,它们在数值微分方面不稳定。人们通常会求助于正则化的微分方案或导出精确微分的算法。对于障碍期权,布朗桥方法导致一个精确的,但非Lipschitz连续的,一阶导数。在这项工作中,我们将证明几乎一阶的弱收敛和布朗桥方法的方差界。然后,我们推广的一步生存的想法,首先介绍了由Glasserman和Staum,一般的标量随机微分方程,并将其与布朗桥的方法,导致一个新的一步生存布朗桥近似。我们表明,新的技术可以适应这样一种方式,其结果满足稳定的二阶希腊人。除了研究稳定性,我们将证明无偏性,导致一个一致收敛性属性和方差减少。此外,我们推导出允许适应路径灵敏度算法的偏导数。此外,我们开发了一个一步生存布朗桥多级蒙特卡罗算法,大大减少了计算量在实践中。
英文摘要:
We consider the pricing and the sensitivity calculation of continuously monitored barrier options. Standard Monte Carlo algorithms work well for pricing these options. Therefore they do not behave stable with respect to numerical differentiation. One would generally resort to regularized differentiation schemes or derive an algorithm for precise differentiation. For barrier options the Brownian bridge approach leads to a precise, but non-Lipschitz-continuous, first derivative. In this work, we will show a weak convergence of almost order one and a variance bound for the Brownian bridge approach. Then, we generalize the idea of one-step survival, first introduced by Glasserman and Staum, to general scalar stochastic differential equations and combine it with the Brownian bridge approach leading to a new one-step survival Brownian bridge approximation. We show that the new technique can be adapted in such a way that its results satisfies stable second order Greeks. Besides studying stability, we will prove unbiasedness, leading to an uniform convergence property and variance reduction. Furthermore, we derive the partial derivatives which allow to adapt a pathwise sensitivity algorithm. Moreover, we develop an one-step survival Brownian bridge Multilevel Monte Carlo algorithm to greatly reduce the computational cost in practice.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。