TY - JOUR
T1 - A Monte Carlo pricing algorithm for autocallables that allows for stable differentiation
AU - Alm, Thomas
AU - Harrach, Bastian
AU - Harrach, Daphne
AU - Keller, Marco
N1 - Publisher Copyright:
© 2013, Incisive Media Ltd. All rights reserved.
PY - 2013/9
Y1 - 2013/9
N2 - We consider the pricing of a special kind of option, the so-called autocallable, which may terminate prior to maturity due to a barrier condition on one or several underlyings. Standard Monte Carlo algorithms work well for pricing these options but they do not behave stably with respect to numerical differentiation. Hence, to calculate sensitivities, we would typically resort to regularized differentiation schemes or derive an algorithm for directly calculating the derivative. In this work, we present an alternative solution and show how to adapt a Monte Carlo algorithm in such a way that its results can be stably differentiated by simple finite differences. Our main tool is the one-step survival idea of Glasserman and Staum, which we combine with a technique known as GHK importance sampling for treating multiple underlyings. Besides the stability with respect to differentiation, our new algorithm also possesses a significantly reduced variance and does not require evaluations of multivariate cumulative normal distributions.
AB - We consider the pricing of a special kind of option, the so-called autocallable, which may terminate prior to maturity due to a barrier condition on one or several underlyings. Standard Monte Carlo algorithms work well for pricing these options but they do not behave stably with respect to numerical differentiation. Hence, to calculate sensitivities, we would typically resort to regularized differentiation schemes or derive an algorithm for directly calculating the derivative. In this work, we present an alternative solution and show how to adapt a Monte Carlo algorithm in such a way that its results can be stably differentiated by simple finite differences. Our main tool is the one-step survival idea of Glasserman and Staum, which we combine with a technique known as GHK importance sampling for treating multiple underlyings. Besides the stability with respect to differentiation, our new algorithm also possesses a significantly reduced variance and does not require evaluations of multivariate cumulative normal distributions.
UR - http://www.scopus.com/inward/record.url?scp=84973595125&partnerID=8YFLogxK
U2 - 10.21314/JCF.2013.265
DO - 10.21314/JCF.2013.265
M3 - Article
AN - SCOPUS:84973595125
SN - 1460-1559
VL - 17
SP - 43
EP - 70
JO - Journal of Computational Finance
JF - Journal of Computational Finance
IS - 1
ER -