Nonlinear Problems: Mathematical Modeling, Analyzing, and Computing for FinanceView this Special Issue
Randomized Binomial Tree and Pricing of American-Style Options
Randomized binomial tree and methods for pricing American options were studied. Firstly, both the completeness and the no-arbitrage conditions in the randomized binomial tree market were proved. Secondly, the description of the node was given, and the cubic polynomial relationship between the number of nodes and the time steps was also obtained. Then, the characteristics of paths and storage structure of the randomized binomial tree were depicted. Then, the procedure and method for pricing American-style options were given in a random binomial tree market. Finally, a numerical example pricing the American option was illustrated, and the sensitivity analysis of parameter was carried out. The results show that the impact of the occurrence probability of the random binomial tree environment on American option prices is very significant. With the traditional complete market characteristics of random binary and a stronger ability to describe, at the same time, maintaining a computational feasibility, randomized binomial tree is a kind of promising method for pricing financial derivatives.
Cox et al.  proposed binomial option pricing method, which can approach the continuous-time option price shown by Black and Scholes  and Merton . As Binomial option pricing method is simple and flexible to price all kinds of complex derivatives, and easy to realize the computer programming, it has become one of the mainstream methods of pricing derivatives, and also one of the frontiers and hot researches on pricing derivatives for decades. Benninga and Wiener and Tian researched the relative properties of the binary tree and priced complex financial derivatives by binary tree to improve the computational efficiency of binary tree algorithm [4, 5]. Rubinstein  expanded the built Edgeworth binary tree with random distribution of Edgeworth, which effectively involved the information of randomly distributed skewness and kurtosis, and made binary tree approach nonnormal distribution when applied to option pricing. Walsh  proved the effectiveness of binary tree algorithm via the study of the convergence and convergence speed problems of binary method from the theoretical point of view. Gerbessiotis  gave a parallel binomial option pricing method with independent architecture, studied algorithm parameter adjustment method of achieving the optimal theory acceleration, and verified the feasibility and effectiveness of the algorithm under different parallel computing environments. Georgiadis  tested that there is no so-called closed-form solution when pricing options with binary tree method. Simonato  posed Johnson binary tree based on the approximation to Johnson distribution of the random distribution, overcoming some possible problems in Edgeworth binary tree that the combination of skewness and kurtosis cannot constitute qualified random distribution. Due to the theory that Hermite orthogonal polynomials can approximate random distribution with the arbitrary precision, Leccadito et al.  raised the Hermite binary tree, which can contain any high-order moments of random distribution, and overcame the problem of numerical instability in Johnson binary tree. Cui et al., Qin et al., and Huang et al. studied the application of functional differential equations to pricing derivatives [12–14]. Wen et al. investigated the impact of the high-order moment and correlation on the prices of options [15, 16]. Yuen et al.  constructed a self-exciting threshold binomial model for pricing options. Aluigi et al.  introduced a fast and accurate derivatives pricing method based on the application of the Chapman-Kolmogorov equation, which has an intuitive lattice representation and is able to price a wide range of derivatives. Jimmy  proposed robust binomial lattices for pricing derivatives where probabilities can be chosen to match local densities. However, in the traditional binary tree market, if the formed combination of the upward movement and downward movement is seen as a market environment (known by the binary theory; determines the unique market volatility ), there is only an environment in the traditional binary tree market and at each node the binary tree moved upward or downward only once (it means that market volatility is the same at any time). However, this assumption is far from the reality of the financial markets, because the stock prices will respond immediately to the various information from domestic and abroad, and thus it is very sensitive. For example, a sudden change in the risk-free interest rate, the conflict with its neighbor countries, good performance of the rival company, a new CEO, and other random emergency information will lead to great fluctuation in stock prices.
Ganikhodjaev and Bayram and Kamola and Nasir [20–22] put forward the random binary tree applied to European option pricing. In this random binary tree market, there are at least two market environments, one of which represents the normal state of the market while the other is the abnormal state of the market. Therefore, the first market environment which represents the normal state of the market corresponds to smaller market volatility and larger probability and the second market environment has larger market volatility and smaller probability. The contribution of this paper is studying the related properties of random binary tree from the viewpoint of complete market and the number of nodes, giving the storage structure of random binary, describing the path characteristics of random binary tree, and researching the American option pricing problem under the random binary market.
The other sections of this paper are as follows. In Section 2, we introduce random binary tree and its properties; the American option pricing problem under random binary environment is studied in Section 3; In Section 4, we demonstrate the effectiveness of the algorithm through a numerical example and study the parameters sensitivity of relevant model.
2. Randomized Binary Tree
2.1. Random Walks in an Independent Environment
Solomon  is the first person to study random walks in an independent environment in the integer field. Let , for all be a sequence of independent and identically distributed random variables; then the random walks in an independent environment in the integer domain are a random sequence , where and , the occurrence probability of is , and the probability of is . Solomon noted that random environment in a certain sense slowed random walk down. And Menshikov  studied the asymptotic behavior of random walks in an independent environment.
2.2. Randomized Binary Tree
Ganikhodjaev and Bayram and Kamola and Nasir [20–22] raised the concept of a random binary tree based on the theory of random walks in an independent environment. In the traditional model of the binary tree, the stock price moves upward in a certain probability or moves downward in a certain probability at each time node. is named as the environment of binary tree and it is the same at any time in the traditional binary tree. In the random binary tree model, and are independent and identically distributed random variables. can only take two values , and can only take two values , . Random market environment describes two market environments and , where the probability of market environment is and the other is .
Theorem 1. If the following condition is satisfied, the random binary tree market must be a market with no arbitrage: where is the risk-free discount factor and the probability of market environment is given.
Proof. See reference [20–22].
Compared with the theorem given in [20–22], Theorem 1 puts forward another condition that the probability of market environment is given. In fact, if this condition is not given, we cannot draw the conclusion that the random binary market is complete although , are uniquely determined when calculating risk-neutral probabilities, for is arbitrary; thus there will be infinitely many unconditional risk-neutral probabilities. In this paper, Theorem 1 shows that, under appropriate conditions, random binary market is a market with no arbitrage as the traditional binary market. That is to say, although there are four successor nodes following each node of random binary tree, it is totally different with quadtree in the incomplete market. Denote the stock price in the first period by ; then the stock price in the th period is where ,, and .
Theorem 2. When the random binary tree is in the th period, the total number of nodes is
Proof. As known by the above equation, for each given , there are kinds of situations for the market environment . But now, there are kinds of market situations for the market environment . It means if the is given, the corresponding quantity of the nodes in the random binary tree is as follows:
In the th period, ; therefore there are nodes in the random binary tree. The proof is over.
As can be seen from Theorem 2, the number of nodes in random binary tree is the cubic polynomial of period, which avoid the problem that the number of nodes shows explosive growth with the increase of when the number of nodes is the exponential function of period (such as ) and makes it computationally feasible. The number of nodes in random binary tree decreases from nonrecombinant down to the cubic polynomial of , so there are all kinds of restructuring its path, and it is more difficult to show its nodes and describe its path.
As can be seen from the formula and the proof of Theorem 2, random binary tree nodes can be described by the four-tuple as follows: where , , and , is the period, is the occurrence number of market environment , the occurrence number of market environment is , represents that the frequency of is under the market environment , which of is , and represents that the frequency of is under the market environment , which of is .
There is a one-to-one relationship between the four-tuple given by formula (6) and the stock price in formula (2). Therefore in the rest of the paper, we often use the four-tuple instead of the stock price in formula (2) without explanation in order to symbol simplicity.
In the random binary tree, the child nodes of the node are where the former two nodes correspond to the market environment and the latter two nodes are for the market environment . To facilitate the calculation process, it must map random binary tree node representation in the four-tuple given by formula (6) to one-dimensional representation. Let
Theorem 3. If the value of is given and the values obtained from four-tuple and four-tuple by mapping are equal, that is, , then must exist; that is, the four-tuple is equal to the four-tuple .
Supposing , we might as well set ; then which is in contradiction with . Therefore if , then .
Suppose further that when ,, , and we might as well let ; then
Therefore which is contradictory. So must exist. Obviously, when ,, there must be , and the theorem is correct. The proof is over.
Theorem 3 shows that in mapping there is a one-to-one mapping relation between random binary tree node and a group of the array. A random binary tree node uniquely corresponds to an element in one-dimensional array and an element in one-dimensional array uniquely corresponds to a random binary tree node.
Suppose that the probability of under the market environment is and which of is and that the probability of under the market environment is and which of is .
Theorem 4. In the random binary tree, the unconditional probability of four child nodes ,,, and of any node are, respectively, ,,, and .
The proof is dropped.
It is easy to obtain the result of Theorem 4 by making use of the Bayesian rule. With the help of Theorem 4, we can compute the expectation of random distribution and furthermore give the price of complex derivatives.
3. Pricing American Options Based on Randomized Binomial Tree
Suppose risk-free rate is , is the risk-free discount factor, is option maturity, is the time of each period of random binary tree, and is the periods of random binary tree. According to the principle of risk-neutral pricing, we can get Set American options maturity is , the payoff function is , and is the option strike price. American option pricing under random binary tree still uses the backward induction method; the specific calculating steps are as follows.
Step 1. On the American option expiry date (the period of the random binary tree), calculating the immediate strike price at each node, this moment American option price is .
Step 2. When the period , for each node in this period, calculate the immediate strike price of American option of this node and then calculate the value of American option to continue to hold The value of American option at node is
Step 3. The initial value of American option is
4. A Numerical Example
Let the first market environment ,, the second market environment ,, continuous risk-free year rate , and initial stock price ; then is the payoff function of American put option, where maturity year and . In Figure 1 there are five curves corresponding to strike price , respectively; the horizontal axis is the occurrence probability of the first market environment, and the vertical axis represents the initial price of American option.
As we know from Figures 1 and 2, whether the real option, at-the-money option, or out-of-the-money option, the prices of American put option and American call option both decrease as the occurrence probability increases under the first market environment . However, the market volatility under the first market environment is less than that under the second market environment . What is more, there is only one market environment in the traditional binomial model, and the corresponding market volatility only considers the normal volatility of the market; thus the traditional binary model, compared with random binary tree model, underestimated the American put and call option price.
In this paper we studied the completeness and nonarbitrage of random binary tree and gave the node representation of the random binary tree as well as describing the path representation method of random binary tree. Based on the backward induction method, the steps and the procedures were shown. Through the numerical example, we studied the sensitivity analysis of American put option price to the random binary tree parameters.
Randomized binary tree maintains the complete-market character of the traditional binary tree; moreover it has a stronger ability to describe and the quantity of nodes is cubic polynomial of the number of periods which makes the calculation feasible. The future research can be extended into two directions: one is to combine with Johnson binary tree and Hermite binary tree so as to further study the relevant characteristics of random binary tree; the other direction is to research other options pricing dependence on the path, such as Asian options, barrier options, and look-back options under the random binary environment.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
The authors would like to thank the anonymous referees for theirvaluable comments and suggestions. Their comments helped to improvethe quality of the paper immensely. This work is partially supportedby NSFC (71273139), Chinese Soft Science (2010GXS5B147), the NationalPublic Sector (weather) Special Fund (GYHY201106019), Department ofPhilosophy and Social Science in colleges and universities in JiangsuProvince research grants (09SJB630006), and the Priority AcademicProgram Development of Jiangsu Higher Education Institutions.
J. C. Cox, S. A. Ross, and M. Rubinstein, “Option pricing: a simplified approach,” Journal of Financial Economics, vol. 7, no. 3, pp. 229–263, 1979.View at: Google Scholar
F. Black and M. S. Scholes, “The pricing of options and corporate liabilities,” Journal of Political Economy, vol. 81, no. 1, pp. 637–659, 1973.View at: Google Scholar
S. Benninga and Z. Wiener, “The binomial option pricing model,” Mathematical in Education and Research, vol. 6, no. 3, pp. 27–33, 1997.View at: Google Scholar
Y. Tian, “A flexible binomial option pricing model,” Journal of Futures Markets, vol. 19, no. 7, pp. 817–843, 1999.View at: Google Scholar
M. Rubinstein, “Edgeworth binomial trees,” Journal of Derivatives, vol. 5, no. 3, pp. 20–27, 1998.View at: Google Scholar
G. Qin, C. Huang, Y. Xie, and F. Wen, “Asymptotic behavior for third-order quasi-linear differential equations,” Advances in Differential Equations, vol. 2013, pp. 1–8, 2013.View at: Google Scholar
E. H. Jimmy, “Robust binomial lattices for univariate and multivariate applications: choosing probabilities to match local densities,” Quantitative Finance, vol. 14, no. 1, pp. 101–110, 2014.View at: Google Scholar
N. Ganikhodjaev and K. Bayram, “Random binomial tree models and options,” Journal of Applied Sciences, vol. 12, no. 18, pp. 1978–1981, 2012.View at: Google Scholar
N. Ganikhodjaev and K. Bayram, “Random cox-ross-rubinstein model and plain vanilla options,” World Applied Sciences Journal, vol. 21, no. 1, pp. 84–87, 2013.View at: Google Scholar
B. Kamola and G. Nasir, “On pricing futures options on random binomial tree,” Journal of Physics: Conference Series, vol. 435, no. 1, pp. 1–10, 2013.View at: Google Scholar
F. Solomon, “Random walks in a random environment,” The Annals of Probability, vol. 3, no. 1, pp. 1–31, 1975.View at: Google Scholar
M. Menshikov and D. Petritis, “Walks in random environment on trees and multiplicative chao,” Working Paper, 2001, http://perso.univ-rennes1.fr/dimitri.petritis/ps/rwre.ps.View at: Google Scholar