Digital barrier options pricing: an improved Monte Carlo algorithm
- First Online:
- Received:
- Accepted:
DOI: 10.1007/s40096-016-0179-8
- Cite this article as:
- Nouri, K., Abbasi, B., Omidi, F. et al. Math Sci (2016) 10: 65. doi:10.1007/s40096-016-0179-8
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 optionDouble barrierMonte Carlo simulationUniform distributionIntroduction
Derivative securities have witnessed incredible innovation over the past years. In particular, path-dependent options are successful, and most of them comprise barrier options to reduce the cost of hedging [4, 8, 22]. For these derivatives, exact valuation expressions are seldom available, thus one resorts to simulations multiple times. In this manuscript a new Monte Carlo method is proposed in order to efficiently compute the prices of digital barrier options based on an exceedance probability.
Barrier options are similar to vanilla options except that the option is knocked out or in, if the underlying asset price hits the barrier price B, before expiration date. Since 1967, barrier options have been traded in the OTC market and nowadays are the most popular class of exotic options. A step further along the option evolution path is where we combine barrier and binary options to obtain binary barrier options and binary double barrier options. Accordingly, it is quite important to develop accurate and efficient methods to evaluate barrier digital option prices in financial derivative markets.
Most research done to date have focused on option pricing with various methods, for example, Mehrdoust [17] has proposed an efficient algorithm for pricing arithmetic Asian options based on the AV and the MCV procedures, and Jerbi et al. [13], have calculated the conditional expectation using the Malliavin approach and shown that with this formula, the American option under J-process can be performed using the Monte Carlo simulation. In addition, Zhang et al. [23], have presented the total least squares quasi-Monte Carlo approach for valuing American barrier options, and Jasra and Del Moral provided a review and development of sequential Monte Carlo (SMC) methods for option pricing [12], and in Kim et al. [15], have considered Heston’s stochastic volatility model and derive exact analytic expressions for the prices of fixed strike and floating-strike geometric Asian options with continuously sampled averages.
The Monte Carlo method is very popular and robust numerical method, since it is not only easily extended to multiple underlying assets but also is stochastic and amenable to coding. On the other hand, one of main drawbacks of the Monte Carlo method is slow convergence. The statistical error of the Monte Carlo method is of order \(O(\frac{1}{\sqrt{M}})\) with M simulations. In particular, for continuously monitored barrier options, the hitting time error is of order \(O(\frac{1}{\sqrt{N}})\) with N time steps, see [7], while the European vanilla options have no time discretization error. In this study, to efficiently reduce the hitting time error near the barrier price, inspired by [16], at each finite time step, we suggest the use of a uniformly distributed random variable and a conditional exceedance probability to correctly check whether the continuous underlying asset price hits the barrier or not. Numerical results show that the new Monte Carlo method converges much faster than the standard Monte Carlo method [18]. This idea of using exceedance probability for stopped diffusion is well known in the physics community [11, 16].
The outline of the paper is as follows: in “Digital options” section, we introduce digital options and their pricing formulas and we estimate it by using standard Monte Carlo. In “Modified Monte Carlo algorithm” section, we propose the new Monte Carlo method based on the idea of using uniformly distributed random variable and the conditional exceedance probability. In “Digital barrier options” section, we present numerical results for digital barrier options with one underlying assets and compare the accuracy and efficiency between the standard and the new Monte Carlo methods. In “Double-barrier digital options” section, we present numerical results for pricing double barrier digital options and see the efficiency of the new Monte Carlo method. Finally, we summarize our conclusions and give some direction for future work.
Digital options
The purpose of this section is to introduce two main types of digital options and express their pricing formula.
Cash-or-nothing options
Asset-or-nothing options
Modified Monte Carlo algorithm
Digital barrier options
- 1.
Cash-or-nothing barrier options. These payout either a prespecified cash amount or nothing, depending on whether the asset price has hit the barrier or not.
- 2.
Asset-or-nothing barrier options. These payout the value of the asset or nothing, depending on whether the asset price has hit the barrier or not.
Example 1
Double-barrier digital options
Example 2
Table 1 gives examples of values for knock-out double-barrier binary options for different choices of barriers and volatilities and the value of them simulation with \(M=10,000\) using the new Monte Carlo in Matlab. Also, Fig. 4 shows comparison between the exact value and the new Monte Carlo values on this example with \(~\sigma =0.1,\) and Fig. 5 displays comparison between the standard MC and the improve MC errors.
Comparison of numerical approximations using the improve MC for Example 2
Double-barrier binary option parameters \(S=100,\,T=0.25,\,r=0.05,\,x=10\) | |||||
---|---|---|---|---|---|
L | U | \(\sigma =0.1\) | \(\sigma =0.2\) | ||
Exact | New MC | Exact | New MC | ||
80 | 120 | 9.873 | 9.864 | 8.977 | 8.898 |
85 | 115 | 9.815 | 9.770 | 7.268 | 7.250 |
90 | 110 | 8.977 | 8.825 | 3.685 | 3.622 |
95 | 105 | 3.667 | 3.598 | 0.091 | 0.081 |
Conclusion
In this paper, we have proposed a new efficient Monte Carlo approach for estimate values of the digital barrier and double barrier options, to correctly compute the first hitting time of the barrier price by the underlying asset. The approximate error of the new method converges much faster than the standard Monte Carlo method. Future work will be devoted to extend this idea to more general diffusion problems, and theoretically study the rate of convergence of the approximate errors, and also pricing digital barrier options by other methods such as SMC and comparing results.
Acknowledgments
The authors are grateful to the referees for their careful reading, insightful comments and helpful suggestions which have led to improvement of the paper.
Copyright information
Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.