10.1007/s40096-016-0179-8

Digital barrier options pricing: an improved Monte Carlo algorithm

  1. Department of Mathematics, Faculty of Mathematics, Statistics and Computer Sciences, Semnan University, Semnan, IR
Cover Image

Published in Issue 2016-04-28

How to Cite

Nouri, K., Abbasi, B., Omidi, F., & Torkzadeh, L. (2016). Digital barrier options pricing: an improved Monte Carlo algorithm. Mathematical Sciences, 10(3 (September 2016). https://doi.org/10.1007/s40096-016-0179-8

PDF views: 113

HTML views: 78

Abstract

Abstract A new Monte Carlo method is presented to compute the prices of digital barrier options on stocks. The main idea of the new approach is to use an exceedance probability and uniformly distributed random numbers in order to efficiently estimate the first hitting time of barriers. It is numerically shown that the answer of this method is closer to the exact value and the first hitting time error of the modified Monte Carlo method decreases much faster than of the standard Monte Carlo methods.

Keywords

  • Digital option,
  • Double barrier,
  • Monte Carlo simulation,
  • Uniform distribution

References

  1. Appolloni, E., Ligori, A.: Efficient tree methods for pricing digital barrier options (2014).
  2. arxiv.org/pdf/1401.2900
  3. Baldi (1995) Exact asymptotics for the probability of exit from a domain and applications to simulation (pp. 1644-1670) https://doi.org/10.1214/aop/1176987797
  4. Ballestra (2014) Repeated spatial extrapolation: an extraordinarily efficient approach for option pricing (pp. 83-91) https://doi.org/10.1016/j.cam.2013.07.033
  5. Bingham and Kiesel (2004) Springer https://doi.org/10.1007/978-1-4471-3856-3
  6. Cortes et al. (2007) Numerical solution of random differential equations: a mean square approach (pp. 757-765) https://doi.org/10.1016/j.mcm.2006.07.017
  7. Cox and Rubinstein (1985) Prentice Hall
  8. Gobet (2000) Weak approximation of killed diffusion using Euler schemes (pp. 167-197) https://doi.org/10.1016/S0304-4149(99)00109-X
  9. Haug (2007) McGraw-Hill Companies
  10. Hui (1996) One-touch double barrier binary option values (pp. 343-346) https://doi.org/10.1080/096031096334141
  11. Hyong-Chol et al. (2014) Integrals of higher binary options and defaultable bonds with discrete default information (pp. 190-214)
  12. Jansons and Lythe (2000) Efficient numerical solution of stochastic differential equations using exponential time stepping (pp. 1097-1109) https://doi.org/10.1023/A:1018711024740
  13. Jasra and Del Moral (2011) Sequential Monte Carlo methods for option pricing (pp. 292-316) https://doi.org/10.1080/07362994.2011.548993
  14. Jerbi and Kharrat (2014) Conditional expectation determination based on the J-process using Malliavin calculus applied to pricing American options (pp. 2465-2473) https://doi.org/10.1080/00949655.2013.827846
  15. Karatzas and Shreve (1991) Springer
  16. Kim and Wee (2014) Pricing of geometric Asian options under Heston’s stochastic volatility model (pp. 1795-1809) https://doi.org/10.1080/14697688.2011.596844
  17. Mannella (1999) Absorbing boundaries and optimal stopping in a stochastic differential equation (pp. 257-262) https://doi.org/10.1016/S0375-9601(99)00117-6
  18. Mehrdoust (2015) A new hybrid Monte Carlo simulation for Asian options pricing (pp. 507-516) https://doi.org/10.1080/00949655.2013.827681
  19. Moon (2008) Efficient Monte Carlo algorithm for pricing barrier options (pp. 285-294) https://doi.org/10.4134/CKMS.2008.23.2.285
  20. Nouri and Ranjbar (2015) Mean square convergence of the numerical solution of random differential equations (pp. 1123-1140) https://doi.org/10.1007/s00009-014-0452-8
  21. Palan (2010) Digital options and efficiency in experimental asset markets (pp. 506-522) https://doi.org/10.1016/j.jebo.2010.05.011
  22. Rubinstein and Reiner (1991) Unscrambling the binary code (pp. 75-83)
  23. Wilmott (1998) Wiley
  24. Zhang et al. (2014) A modified least-squares simulation approach to value American barrier options (pp. 489-506) https://doi.org/10.1007/s10614-013-9409-4