Pricing American-style Basket Options By Implied Binomial Tree
|
|
- Ζένα Αλεξιάδης
- 8 χρόνια πριν
- Προβολές:
Transcript
1 Priing Amerian-style Basket Options By Implied Binomial Tree Henry Wan * Draft: Marh 00 Abstrat It is known that the most diffiult problem of priing and hedging multi-asset basket options are those with both high dimensionality and early exerise. This artile proposes a numerial algorithm by reduing multivariate distributions of a portfolio into a single variable and modeling that as a univariate stohasti proess in the form of an implied binomial tree. It is demonstrated that the method provides a fast and flexible way of priing and hedging high dimensional multi-asset basket options with early exerise. * This artile is a report to the Applied Finane Projet of University of California at Berkeley. The author is grateful for omments of traders at Wahovia Seurities, Jens Jakwerth at University of Konstanz, Germany, and Mark Broadie at Columbia University. The author is partiularly grateful for the extensive and insightful suggestions of Mark Rubinstein for advising the projet.
2 Introdution A basket option is an option on a portfolio of several underlying assets. With growing diversifiation in investor's portfolio, options on suh portfolios are inreasingly demanded. One example of the demand is purhasing a protetive put option on a portfolio suh that investor's down side risk is limited. However, Amerian-style basket options ontinue to be hallenging in terms of both algorithm omplexity and omputational burden. The modeling and mathematis of priing basket options are similar to those of options on a single asset exept that there are orrelated random walks and multi-variate Ito's lemma that need to be applied. In very few speial ases, suh as exhange options, losed form solutions an be found. More often, numerial methods suh as numerial integration, finite-differene methods and simulations are neessary for low or medium size problems. When dimension is higher, it is relatively heaper to use simulations sine its omputational ost does not inrease exponentially as other methods. The ease exists only for European-style options. It is however known that the most diffiult problems of priing and hedging multi-asset basket options are those with both high dimensionality, for whih we would like to use simulation, and with early exerise, for whih we would like to use either binomial tree or finite differene methods. "There is urrently no numerial method that opes well with suh a problem" (Wilmott, 998). There have been many artiles published on topis of multi-dimensional Amerian-style options. They an be ategorized by either lattie-based or simulation-based approahes. Lattie-based approahes, suh as binomial trees, trinomial trees and finite differene methods, are widely used for options on a single asset. When dimension is higher, usually up to four, extensions of binomial and trinomial trees from the univariate binomial tree (Cox, Ross and Rubinstein 979) an be applied. Rubinstein (994a) models twoasset rainbow options using "binomial pyramids". It generalizes one-dimension up and down trees into twodimensional squares. The similar approah an be further extended into higher dimensions. Appendex A generalizes this approah into four dimensions. The finite differene methods an also be extended into multiple dimension ases by using Alternating Diretions Impliit (ADI) method (Clewlow and Strikland, 998). Although these lattie-based approahes are generally easy to deal with early exerise by a bakward algorithm, their memory and omputation requirements explode exponentially as the dimension of problem inreases. On the other hand, without exponentially growing omputation effort as most lattie-based methods do for higher dimension options, simulation enjoys high flexibility and modest omputational ost independent of dimensions of a problem. The embedded forward simulation algorithm, however, underlies its diffiulty in priing options with early exerise features, suh as Amerian options. These options generally require a bakward algorithm to determine the optimal exerise poliy. Sine the laim written by Hull (997) that "A limitation of the simulation approah is that it an be used only for European-style derivatives", many papers have devoted to overome this hallenge. As the reviewing work done by Broadie and Glasserman (997b), there are three main tehniques in applying simulation into multi-asset Amerian options. In many ases, multiple of suh tehniques are applied into an algorithm. One ategory of tehniques is based on parametrization of exerise boundary and uses simulation to maximize the expeted payoff within the parametri family. Different optimization methods and families of urve fitting funtions have been proposed. The seond approah is based on finding both upper and lower bounds for option prie and giving valid onfidene intervals for the true value. The simulated trees method and the stohasti mesh algorithm proposed by Broadie and Glasserman (997a, 997) and the reent primal-dual simulation algorithm by Andersen and Broadie (00) belong to this ategory. In the simulated tree method, eah single node generates its own non-ombining independent subtree from samples. The priing is then arried out by a bakward reursive proedure. Although the method is linear in the problem dimension, it is exponential in terms of the number of steps. The stohasti mesh method has the advantage of linear in the number of exerise opportunities, but interloks among nodes in the mesh reate onsiderably ompliation in the algorithm. Reently there are developments of applying duality to ompute an upper bound of true prie from the speifiation of
3 some arbitrary martingale proess. The tightness of the upper bound depends ritially on the hoie of the martingale proess. Andersen and Broadie (00) signifiantly improve the performane of the alulation. The third ategory of tehniques, whih is also the most widely used one in ombining with other approahes, is the dynami programming style bakward reursion in determining the optimal exerise poliy. Tilley (993) used bakward algorithm and bundling tehnique for approximating the prie and the optimal exerise deision into the simulation. It is effiient and easy in priing one-dimension Amerian options. Sine then artiles were published on the improvement of this basi onept. Longstaff and Shwartz (00) used least-squares regression on polynomials to approximate the holding value and optimum to exerise. Barraquand and Martineau (995) applied a state aggregation tehnique and redued a high-dimensional problem into a single dimension one sine the exerise deision only depends on the single variable, the intrinsi value. The resulting one-dimension problem an be solved quikly by standard bakward dynami programming and provides signifiant omputation saving for high-dimensional problems. Although it is extremely fast in alulating an approximation of prie, the auray primarily depends on how well the optimal exerise poliy an be represented by the single payoff variable. In some multi-dimensional ases, the option payoff is not suffiient to determine the optimum to exerise. As Broadie and Glasserman (997) indiated, "the stratifiation algorithm will not onverge to the orret value." The approah to priing basket options in the artile is similar in spirit to the onept of Barraquand and Martineau (995) by reduing a high-dimensional problem into a single variable one. In the ase of basket options, the basket itself is the variable in determining its holding and exerise values. Instead of using simulated histogram, our method uses a set of European-style standard options to infer the risk-neutral probabilities and hene the stohasti proess of the basket represented by an implied binomial tree. We will show the results of this approah onverge to the orret value with modestly inreasing the number of steps. The Approah The method we use to prie a basket option involves four steps. First, we value European-style standard all and put options with different strikes, whose underlying is the multi-asset basket, by simulations. Seond, we infer the risk-neutral probabilities of the basket from the set of European-style options on the basket, the assoiated market prie of the basket, and the risk-less interest rate bond. Third, we reover the fully speified stohasti proess of the basket, in the form of an implied binomial tree, from its risk-neutral probabilities. Finally, with the implied tree, we an alulate the value and hedging parameters of any derivative instruments on the basket maturing with or before the European options. simulation in valuing European-style standard basket options The first step is valuing European-style standard all and put options of the basket. As we know, an - variate binomial tree beomes exponentially ompliated and omputationally expensive when both the number of assets and the number of moves are getting larger. For example, when a tree has 00 moves and deals with only 4 assets simultaneously, the number of nodes at the end will be (00+) 4, or about 00 million. Suh numerous omputations and memory requirement prevents us from using the lattie-based method to value high-dimensional Europen-style basket options. Another set of approahes to value multi-asset basket options is by simulations. Sine the value of a European-style option is the risk-neutral expetation of its disounted payoff at the time of maturity, simulations obtain an estimate of suh a risk-neutral expetation by omputing the average of a large number of disounted payoffs. Beause the omputation effort of simulation is independent of the number of random fators, it is heap to value European-style multi-asset basket options with high dimensionality in terms of omputation and memory requirements. The simulation
4 is also flexible to inorporate other proesses and fators, suh as random volatility, random interest rates, jumps in asset pries, and other more realisti market onditions. Our approah, however, is not valuing Amerian-style basket options by simulations. The purpose of using simulation is to utilize its flexibility in modeling multiple random fators or more realisti random proesses, as a tool to obtain the risk-neutral distribution of the underlying basket. The approah involves three steps in applying simulations : () Simulate the ending asset pries in a basket under the risk-neutral measure. A way of simulating multi-dimensional stohasti proess is desribed in Appendix B, where a orrelation matrix among different proess is assumed given. In general, a European option an be valued as the expeted risk-neutral payoff at expiry. M s Cˆ ( ) = exp( rt ) Payoff T () M s= where M is the number samples. () Estimate the mean and standard deviation of the return on the basket. Assuming there are M simulation samples, eah simulation ends up with a set of asset pries at the expiration T. The asset pries, therefore, determine a value of the basket and hene the return on the basket from the time zero. With M samples of basket returns, one an alulate the unbiased estimations on both mean and standard deviation of basket returns under the risk-neutral measure: ( s) 0 M M ( s) ( s) [ R ] ˆ σ = ( R ˆ μ ) s= M s= ( s) ( s) ( s) [ n S + n S + L + n S ] log[ S ] ˆ μ = M R S log n S,0, T + n S,0, T + L + n S,0, T 0 (3) Value the European-style standard all and put options based on a set of equally log-spaed strike pries. Consider we want to value m+ options with different strikes, the strikes we hoose are: j m ( ˆ μ + x ˆ ) x, j = 0,,, m K j = S0 exp jσ j L, m The options we hoose are all out-of-money options. That is, we value the European put options for the exp μˆ K j exp μˆ. strikes K j < ( ), and the European all options for those strikes ( ) S 0 The valuation for the set of alls and puts are fast beause we only need to proeed the time-onsuming simulation in step () one. After the M outomes have been simulated, the valuation is simply applying Equation () in omputing expeted payoffs. The effiieny of all simulation an be improved by using variane redution tehniques. In the interest of this artile, the desription of these tehniques is not emphasized. S 0
5 Implied Ending Risk-eutral Probabilities The seond step of the approah is to infer the implied ending risk-neutral probabilities of the univariate basket from the set of European-style alls and puts on the basket. Consider a state seurity, or Arrow-Debreu seurity, whih pays one dollar if a speifi future state is realized and zero otherwise, the prie of suh a seurity an be used to build more ompliated payoffs at the expiration. For example, if a seurity pays X, X,, and X n if the states,,, and are realized respetively. The prie of this seurity at time zero will be the sum of those payoffs weighted by state pries assoiated with the orresponding states. C = (X *q + X * q + + X n * q n ) / r ow, if we disretize the ontinuous prie spae into disrete states similar to a binomial tree at the end of the expiration date, the payoffs of a standard European all option with strike prie K under those states will be: C = max { 0, ST j K } j = 0,,,., m The prie of a European all option is: C = j π j max{0, ST j K} Similarly, the prie of a European put option will be: P = j π j max{0, K ST j } As we mentioned, we have obtained a set of European-style all and put options on the basket through the simulation. We an use them to imply the state pries and hene the risk-neutral probabilities of the univariate basket. Assuming there are m+ disrete states at the expiration. We want to find out the state pries for them. The state pries an be omputed by the pries of standard European options, the urrent value of the basket, and the prie of zero-oupon risk-free bond. If the states are hosen to be the set of strikes we hoose for the standard options in the previous setion, where K 0 < K < < K m, we an reate a payoff table as shown below for the standard alls, puts, the underlying asset and the risk-free bond. States Seurity Pries Strike K 0 K K K j- K j K m- K m- K m Put P(K ) K K K 0 Put P(K ) K K K 0 K K Put P(K 3 ) K 3 K 3 K 0 K 3 K K 3 K Put P(K j- ) K j- K j- K 0 K j- K K j- K 0 Call C(K j ) K j 0 K m- K j K m- K j K m K j Call C(K m-3 ) K m-3 K m- K m-3 K m- K m-3 K m K m-3 Call C(K m- ) K m- K m- K m- K m K m- Call C(K m- ) K m- K m K m- Asset S 0 0 e d*t K 0 e d*t K e d*t K e d*t K j- e d*t K j e d*t K m- e d*t K m- e d*t K m Bond e -r*t Table : Payoff table of standard alls and puts
6 Consider the lowest strike of the put option P(K ), it pays K K 0 when the state is K 0 and zero for all the states above K 0. Therefore, the state prie for K 0 is nothing but P(K )/(K K 0 ). P(K ) = (K K 0 ) π 0 π 0 = P(K ) / (K K 0 ) ow onsider the put options with strike K, its prie is given by: P(K ) = (K K 0 ) π 0 + (K K ) π There is only one unknown π, sine π 0 has been solved previously. We an ontinue this proess forward by applying the prie of put option and previously solved state pries π k, k = 0,,, i- to solve for the state prie π i- : P(K i ) = k=0,,i- (K i K k ) π k + (K i K i- ) π i- To avoid building up numerial errors in states with high pries, we use all options and start with the high end of strikes. For example, the state prie for K m an be omputed by C(K m- )/(K m K m- ) sine the all option C(K m- ) only pays K m K m- when the state is K m and zero elsewhere. Other state pries an be omputed progressively by applying the following: C(K i ) = (K i+ K i ) π i+ + k=i+,,m (K k K i ) π k The above proedure an be used to ompute most of the state pries exept two states adjaent to the forward pries of the underlying asset. In our ase, they are strikes K j- and K j where the puts and alls are met in our payoff table. To solve for state pries for these two states, another two equations are introdued to satisfy no-arbitrage onditions for the forward prie of underlying asset and the prie of risk-free bond. Aording to the payoffs of these two seurities, we have, S 0 exp(-dt) = k=0,,j- K k π k + K j- π j- + K j π j + k=j+,,m K k π k, and exp(-rt) = k=0,,j- π k + π j- + π j + k=j+,,m π k Two equations and two unknowns, we an solve for both π j- and π j. After we obtain all the state pries, the risk-neutral probabilities are nothing but the state pries inflated by interest rate. q i = π i exp(rt), for all i = 0,,, m Implied Binomial Tree of the basket After retrieving the ending risk-neutral probabilities, the next step of our approah is to reover the implied stohasti proess of the basket, in the form of its implied binomial tree. The idea behind this is reognizing that the pries of standard European options of the basket embed information about the underlying basket portfolio. If there exists a diffusion proess to ahieve its values of European options, the Amerian-style or other exoti options should follow the same proess. Here, the standard European-style options are treated as fundamental seurities, whose pries are given. In our ase, the option pries are through simulations. Rubinstein (994, 998) presents a method in onstruting an implied binomial tree by using the ending risk-neutral distributions. Other approahes in onstruting implied trees, for example implied trinomial trees, an be found from the overview literature by Jakwerth (999). Implied trees are not unique without making speifi assumptions on how the underlying asset prie reahes the terminal distribution. The main assumption of Rubinstein's method is that the path probabilities for all paths reahing the same terminal state are equal. Here is a summary of the method. Assuming that an asset may either move up or down at
7 any given time, and assuming two paths with up-then-down and down-then-up lead to the same outome of the asset in the end. These assumptions lead a ombining binomial tree as shown in Figure. At the end of n-th period, there are total n+ possible outomes or nodes on the tree. Eah has a node probability P node (n,j) whih is the disrete probability mass of the outome at node (n,j). Figure also shows a ommon bell-shaped node probabilities. With the assumption of ombining binomial tree, there are n-hoose-j leading paths that ause the same outome at node (n,j). We further assume all the paths leading to the same outome (n,j) have the same path probability p path (n,j). Therefore, p path ( n, j) = P node n C j ( n, j) = P node ( n, j) n! j!( n j)! Ending risk-neutral dist. Probability Tree P(n-,j) q -q P(n,j), p(n,j) P(n,j+), p(n,j+) Figure : Implied Binomial Tree Moving bakward from the n-th period into "n-"-th period, for a node (n-,j), it has two paths to move ahead, either up to the node (n, j) or down to the node (n,j+). Eah path has the path probability of p path (n,j) and p path (n,j+). So the node probability of this node (n-,j), whih is the probability of getting to there from the root of the tree, is the sum of two path probabilities leading to the next period. P node ( n, j) = p ( n, j) + p ( n, j + ) path path The loal up-move probability q is the probability of the movement to (n,j) given the ondition that the movement is started from node (n-,j). Therefore, the onditional down-move probability is -q. p q = P node ( n, j) ( n, j) path = p path p path ( n, j) ( n, j) + p ( n, j + ) path If we are given a risk-neutral probability distribution at the end of expiry, the implied probability tree an be onstruted, by working bakward from the period to 0 by applying the above equations reursively. At the same time, trees for both asset and the option are also onstruted bakward. Options payoff Asset Tree q S(n-,j) -q S(n,j) S(n,j+) Options Tree q V(n-,j) -q V(n,j) V(n,j+) Figure : Implied Asset and Option Trees
8 In the ase of an Amerian put option on a basket, whose ending risk-neutral probabilities are given, the reursive formula for both the value of basket and the put option are as following: S(n-,j) = [q * S(n,j) + (-q) * S(n, j+)] * exp[-(r-d)h] P(n-,j) = max { K S(n-,j), [q * P(n,j) + (-q) * P(n,j+)] * exp(-rh) } Amerian all options an be proeeded similarly. With the implied tree on the basket, we are able to both prie and hedge the basket options by standard tehniques used in binomial tree. The following setion demonstrates numerial results of implementing our approah in omparing to other methods. Results Single asset options Our first example is a speial ase of single asset options. We will show how to bak out the implied binomial tree and obtain the exat same results as those alulated by the ordinary binomial tree for both European and Amerian-style single asset options. Consider options on single underlying stok: Time to Expiration: T =.0 year Interest Rate: r = 0% Dividend Yield: δ = 5% Volatility: σ = 0% Spot Prie: S 0 = 00 Strike Pries: K = 60, 70, 80, 90, 00, 0, 0, 30, 40. We first onstrut a simple two-step binomial tree to illustrate our approah. In the example, we have two moves, i.e., m =, h = 0.5. After omputing the multipliative fators for both upward and downward moves, where u = exp[(rδ½σ )h + σ h] =.693, and d = exp[(rδ½σ )h σ h] = 0.88, We have the binomial tree as shown in Exhibit. The tree is onstruted suh that there is an equal probability of one-half for the asset prie to either move up or move down. ½ ½ 6.93 ½ ½ 88. ½ ½ Exhibit : Standard Two-step Binomial Tree This tree an be used to prie both European and Amerian-style options. The omputation results for various strikes, ranging from 60 to 40, are shown in the 4 th and 5 th olumns in Exhibit 5 for all options and in the 0 th and th olumns for put options. In omparison, we also list the ' pries for
9 European-style options. It is believed that binomial tree is the disretization of the ontinuous-time model. ow, we want to show that we an reover the above binomial tree by using a set of European-style standard all and puts, the urrent asset prie and the risk-free bond. Consider the three ending outomes on the tree. Their node probabilities are ¼, ½, and ¼ respetively. Therefore, the mean and standard deviation of their log-returns are 0.03 and = ¼ * log(36.73/00) + ½ * log(03.04/00) + ¼ * log(77.66/00) 0. = {¼ * [log(36.73/00)-0.03] + ½ * [log(03.04/00)-0.03] + ¼ * [log(77.66/00)-0.03] } ½ As we indiate previously, we sample the ending state spae by using the formula S 0 *exp[mean + std * (j - m)/ m], j=0,,, m. In our ase, this formula leads to sampling states at 77.66, 03.04, and ext, we show we are able to reover the entire binomial tree by given European-style option pries struk at these sampling states. For example, a European all option struk at 03.05, is valued at 7.6 by using the above two-step binomial tree. The valuation tree is shown in Exhibit. ½ ½ 6.0 ½ ½ 0 ½ ½ 0 Exhibit : Binomial Tree for a Call Option By using this European all option, together with the underlying asset and risk-free bond, we an ompute the risk-neutral probabilities of the three states. The payoff table for the three seurities under three different states and the alulated ending risk-neutral probabilities are listed in Exhibit 3. States Seurity Pries Strike Call Asset 00 0 e 0.05 *77.66 e 0.05 *03.05 e 0.05 *36.73 Bond states probability Exhibit 3: Payoff table and Risk-neutral probabilities By using the ending risk-neutral probabilities, we reover the implied binomial tree as shown in Exhibit 4. In this trivial ase, the implied tree is exatly the same as the original binomial tree. Therefore, the priing results by using binomial tree and the implied tree should be the same for both European and Amerianstyle options. Exhibit 5 shows suh omparison between results by standard binomial tree and those by implied tree with the same number of moving steps.
10 ½ ½ 6.93 ½ ½ 88. ½ ½ Exhibit 4: Implied Binomial Tree (One-Asset) Binomial Tree ( steps) (500000) Binomial Tree ( steps) (500000) Differenes to the results from -D Binomial Tree Binomial Tree ( steps) (500000) Differenes to the results from -D Binomial Tree Binomial Tree ( steps) (500000) Exhibit 5: Prie Comparison (-step trees) Exhibit 5 ompares the results of the implied tree to those of ' model and simulations. Although both binomial tree and implied tree value options slightly different with those of ontinuous model, the differene will be orreted by inreasing number of steps as shown in Exhibit 6, where 00 steps of trees are used. Implied Tree ( steps) Implied Tree ( steps) Strike European European Amerian European European Amerian Strike European European Amerian European European Amerian Implied Tree ( steps) Implied Tree ( steps) Strike European European Amerian European European Amerian Strike European European Amerian European European Amerian Binomial Tree (00 steps) (500000) Implied Tree (00 steps) Binomial Tree (00 steps) (500000) Implied Tree (00 steps) Strike European European Amerian European European Amerian Strike European European Amerian European European Amerian Differenes to the results from -D Binomial Tree Differenes to the results from -D Binomial Tree Binomial Tree (00 steps) (500000) Implied Tree (00 steps) Binomial Tree (00 steps) (500000) Implied Tree (00 steps) Strike European European Amerian European European Amerian Strike European European Amerian European European Amerian Exhibit 6: Prie Comparison (00-step trees)
11 Two-asset options Assuming the options payoff depend on the value of basket whih is defined as n S + n S. Information about the basket options and the underlying assets are listed as below. Time to Expiration: T =.0 year Interest Rate: r = 5% Dividend Yield: δ = 5%, δ = 5% Volatilities: σ = 0%, σ = 0% Correlation: ρ = 0.5 Spot Pries: S,0 = 50, S,0 = 50 # of shares: n =, n = Strike Pries: K = 60, 70, 80, 90, 00, 0, 0, 30, 40. The benhmark valuation model is the two-dimensional binomial tree, or the so alled the "binomial pyramids." As a simple example, we start with a two-step two-dimensional binomial tree. For eah node, there are four possible moves in the -dimensional prie spae. The four multipliative moving vetors an be alulated as: (u, A), (u, B), (d, C) and (d, D), where u = exp[(rδ ½σ )h + σ h] =.404 d = exp[(rδ ½σ )h σ h] = A = exp[(rδ ½σ )h + σ h (ρ + ρ )] =.00 B = exp[(rδ ½σ )h + σ h (ρ ρ )] = C = exp[(rδ ½σ )h σ h (ρ ρ )] =.046 D = exp[(rδ ½σ )h σ h (ρ + ρ )] = 0.86 By the end of two steps, there are 3-by-3 nodes in the two dimensional spae. Exhibit 7 gives all the nine nodes and their assoiated node probabilities. The undersored numbers are values of the basket (65.03, 7.) (65.03, 56.46) (65.03, 44.9) (49.0, 6.6) (49.0, 49.0) (49.0, 38.36) (36.94, 54.36) (36.94, 4.55) (36.94, 33.30) Ending odes odal Probabilities Exhibit 7: Ending odes and ode Probabilities on a Two-Dimension Tree As we see, the two-step bivariate binomial model effetively reates nine different states for the basket, and basket options are nothing but options on the single-variate basekt. We will show that a single-variate implied tree reovered by the risk-neutral probabilities of the basket an be used to prie and hedge suh options.
12 Our first step is to sample out three disrete states from the 3-by-3 possible ending values of the basket in order to build a two-steps implied tree. This is done by the equal log-spaed sampling method desribed in the previous example of single-asset options. We start with alulating the mean and standard deviation of the basket's log-returns. Knowing the 3-by-3 possible ending values of the basket and the orresponding nodal probabilities, we an ompute the mean and standard deviation of log-returns on the basket. In this ase, they are and 0.733, respetively. We sample three states out for onstruting a two-steps implied tree, based on the formula: S 0 *exp[mean + std * (j - m)/ m], j=0,,, m, where m =. The states are 77.0, 98.5 and The seond step is to retrieve risk-neutral probabilities of the three states. They are obtained by reating a no-arbitrage payoff table using the pries of standard European options, urrent prie of the basket and the risk-free bond. The proess is similar to that of in the single asset example. Exhibit 8 shows the "binomial pyramids" in priing a two-asset all option struk at Its prie is 7.3. The resultant payoff table aross states as well as the risk-neutral probabilities is in Exhibit Exhibit 8: Two-Dimension Binomial Tree for a Call Option States Seurity Pries Strike Call Asset 00 0 e 0.05 *77.0 e 0.05 *98.5 e 0.05 *5.87 Bond states probability Exhibit 9: Payoff table and Risk-neutral Probabilities Our third step is using the risk-neutral probabilities to onstrut implied binomial tree. The single-variate implied tree for the basket is obtained in Exhibit 0. The option tree for priing an Amerian all option with strike at 80 is also shown in Exhibit, where the undersored 33.8 indiate an early exerise at that node Exhibit 0: Implied Binomial Tree (Two-Asset basket)
13 Exhibit : Option Tree for Amerian Call with Strike at 80 In Appendix C, various ases are tested with inreasing number of steps in demonstrating the onvergene between the results from implied tree and those obtained from multi-dimension binomial tree. In omparison, we also implement three other methods, whih are: () the standard Blak ' formula for European options using the return volatility obtained from the ending risk-neutral probability, () simulation for European options, and (3) the Least-squares simulation for Amerian options. In most ases, we keep all five methods with the same steps exept some of the three- and four-asset ases where neither the multi-dimensional binomial trees nor simulations are able to handle 00 steps or more. Conlusion This artile ontributes the ongoing hallenge of priing Amerian-style multi-asset basket options using a ombination of simulation and implied binomial tree. The method provides a quik valuation and further hedging parameters via the generated implied tree. At the mean time, the appliation of simulation brings the possibility of inorporation of other fators suh as random volatility and orrelation, random interest rate, and jumps.
14 Appendix C: Test Results Two-asset options (Case ) Time to Expiration: T =.0 year Interest Rate: r = 5% Dividend Yield: δ = 5%, δ = 5% Volatilities: σ = 0%, σ = 0% Correlation: ρ = 0.5 Spot Pries: S,0 = 50, S,0 = 50 # of shares: n =, n = Strike Pries: K = 60, 70, 80, 90, 00, 0, 0, 30, 40. Risk-eutral Probabilities Option Probabilities Strike Put/Call Pries Risk-neutraormal Diffs P P P P P P P P P P C C C C C C C C C C C risk-neutral probabilities Risk-neutral ormal differene
15 Two-Asset Case() Steps: 0 Differenes to the results from -D Binomial Tree Differenes to the results from -D Binomial Tree Two-Asset Case() Steps: 0 Differenes to the results from -D Binomial Tree Differenes to the results from -D Binomial Tree (0000) (0000) Binomial Tree Implied Tree (0000) (0000) Binomial Tree Implied Tree Binomial Tree Implied Tree Binomial Tree Implied Tree (0000) (0000) Binomial Tree Implied Tree (0000) (0000) Binomial Tree Implied Tree Binomial Tree Implied Tree Binomial Tree Implied Tree
16 Two-Asset Case() Steps: 50 (0000) (0000) Differenes to the results from -D Binomial Tree Differenes to the results from -D Binomial Tree Two-Asset Case() Steps: 00 Differenes to the results from -D Binomial Tree Differenes to the results from -D Binomial Tree (0000) Binomial Tree Implied Tree (0000) Binomial Tree Implied Tree Binomial Tree Implied Tree Binomial Tree Implied Tree (0000) (0000) Binomial Tree Implied Tree (0000) (0000) Binomial Tree Implied Tree Binomial Tree Implied Tree Binomial Tree Implied Tree steps are applied to both simulation and the Least Squares.
17 Two-asset options (Case ) Time to Expiration: T =.0 year Interest Rate: r = 5% Dividend Yield: δ = 5%, δ = 5% Volatilities: σ = 0%, σ = 90% Correlation: ρ = -0.9 Spot Pries: S,0 = 50, S,0 = 50 # of shares: n =, n = Strike Pries: K = 60, 70, 80, 90, 00, 0, 0, 30, 40. Risk-eutral Probabilities Option Probabilities Strike Put/Call Pries Risk-neutraormal Diffs.884 P P P P P P P P P P C C C C C C C C C C C risk-neutral probabilities Risk-neutral ormal 0.0 differene
18 Two-Asset Case() Steps: 0 Differenes to the results from -D Binomial Tree Differenes to the results from -D Binomial Tree Two-Asset Case() Steps: 0 Differenes to the results from -D Binomial Tree Differenes to the results from -D Binomial Tree (0000) (0000) Binomial Tree Implied Tree (0000) (0000) Binomial Tree Implied Tree Binomial Tree Implied Tree Binomial Tree Implied Tree (0000) (0000) Binomial Tree Implied Tree (0000) (0000) Binomial Tree Implied Tree Binomial Tree Implied Tree Binomial Tree Implied Tree
19 Two-Asset Case() Steps: 50 Differenes to the results from -D Binomial Tree Differenes to the results from -D Binomial Tree Two-Asset Case() Steps: 3 00 Differenes to the results from -D Binomial Tree Differenes to the results from -D Binomial Tree (0000) (0000) Binomial Tree Implied Tree (0000) (0000) Binomial Tree Implied Tree Binomial Tree Implied Tree Binomial Tree Implied Tree (0000) (0000) Binomial Tree Implied Tree (0000) (0000) Binomial Tree Implied Tree Binomial Tree Implied Tree Binomial Tree Implied Tree steps are applied to both simulation and the Least Squares.
20 Three-asset options (Case ) Time to Expiration: T =.0 year Interest Rate: r = 5% Dividend Yield: δ = 5%, δ = 5%, δ 3 = 5% Volatilities: σ = 0%, σ = 0%, σ = 0% Correlation: Spot Pries: S,0 = 33.33, S,0 = 33.33, S 3,0 = # of shares: n =, n =, n 3 = Strike Pries: K = 60, 70, 80, 90, 00, 0, 0, 30, 40. Risk-eutral Probabilities Option Probabilities Strike Put/Call Pries Risk-neutraormal Diffs 47.5 P P P P P P P P P P C C C C C C C C C C C risk-neutral probabilities Risk-neutral ormal differene Three-Asset Case() Steps: 0 Differenes to the results from 3-D Binomial Tree Differenes to the results from 3-D Binomial Tree (0000) (0000) Binomial Tree Implied Tree (0000) (0000) Binomial Tree Implied Tree Binomial Tree Implied Tree Binomial Tree Implied Tree
Econ 2110: Fall 2008 Suggested Solutions to Problem Set 8 questions or comments to Dan Fetter 1
Eon : Fall 8 Suggested Solutions to Problem Set 8 Email questions or omments to Dan Fetter Problem. Let X be a salar with density f(x, θ) (θx + θ) [ x ] with θ. (a) Find the most powerful level α test
Διαβάστε περισσότεραHomework 3 Solutions
Homework 3 Solutions Igor Yanovsky (Math 151A TA) Problem 1: Compute the absolute error and relative error in approximations of p by p. (Use calculator!) a) p π, p 22/7; b) p π, p 3.141. Solution: For
Διαβάστε περισσότερα6.3 Forecasting ARMA processes
122 CHAPTER 6. ARMA MODELS 6.3 Forecasting ARMA processes The purpose of forecasting is to predict future values of a TS based on the data collected to the present. In this section we will discuss a linear
Διαβάστε περισσότεραCHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS
CHAPTER 5 SOLVING EQUATIONS BY ITERATIVE METHODS EXERCISE 104 Page 8 1. Find the positive root of the equation x + 3x 5 = 0, correct to 3 significant figures, using the method of bisection. Let f(x) =
Διαβάστε περισσότεραPhys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required)
Phys460.nb 81 ψ n (t) is still the (same) eigenstate of H But for tdependent H. The answer is NO. 5.5.5. Solution for the tdependent Schrodinger s equation If we assume that at time t 0, the electron starts
Διαβάστε περισσότεραLanczos and biorthogonalization methods for eigenvalues and eigenvectors of matrices
Lanzos and iorthogonalization methods for eigenvalues and eigenvetors of matries rolem formulation Many prolems are redued to solving the following system: x x where is an unknown numer А a matrix n n
Διαβάστε περισσότεραEE512: Error Control Coding
EE512: Error Control Coding Solution for Assignment on Finite Fields February 16, 2007 1. (a) Addition and Multiplication tables for GF (5) and GF (7) are shown in Tables 1 and 2. + 0 1 2 3 4 0 0 1 2 3
Διαβάστε περισσότερα2 Composition. Invertible Mappings
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan Composition. Invertible Mappings In this section we discuss two procedures for creating new mappings from old ones, namely,
Διαβάστε περισσότεραStatistical Inference I Locally most powerful tests
Statistical Inference I Locally most powerful tests Shirsendu Mukherjee Department of Statistics, Asutosh College, Kolkata, India. shirsendu st@yahoo.co.in So far we have treated the testing of one-sided
Διαβάστε περισσότεραThe Simply Typed Lambda Calculus
Type Inference Instead of writing type annotations, can we use an algorithm to infer what the type annotations should be? That depends on the type system. For simple type systems the answer is yes, and
Διαβάστε περισσότεραSection 8.3 Trigonometric Equations
99 Section 8. Trigonometric Equations Objective 1: Solve Equations Involving One Trigonometric Function. In this section and the next, we will exple how to solving equations involving trigonometric functions.
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Αν κάπου κάνετε κάποιες υποθέσεις να αναφερθούν στη σχετική ερώτηση. Όλα τα αρχεία που αναφέρονται στα προβλήματα βρίσκονται στον ίδιο φάκελο με το εκτελέσιμο
Διαβάστε περισσότεραderivation of the Laplacian from rectangular to spherical coordinates
derivation of the Laplacian from rectangular to spherical coordinates swapnizzle 03-03- :5:43 We begin by recognizing the familiar conversion from rectangular to spherical coordinates (note that φ is used
Διαβάστε περισσότεραOther Test Constructions: Likelihood Ratio & Bayes Tests
Other Test Constructions: Likelihood Ratio & Bayes Tests Side-Note: So far we have seen a few approaches for creating tests such as Neyman-Pearson Lemma ( most powerful tests of H 0 : θ = θ 0 vs H 1 :
Διαβάστε περισσότεραHOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch:
HOMEWORK 4 Problem a For the fast loading case, we want to derive the relationship between P zz and λ z. We know that the nominal stress is expressed as: P zz = ψ λ z where λ z = λ λ z. Therefore, applying
Διαβάστε περισσότεραMath 6 SL Probability Distributions Practice Test Mark Scheme
Math 6 SL Probability Distributions Practice Test Mark Scheme. (a) Note: Award A for vertical line to right of mean, A for shading to right of their vertical line. AA N (b) evidence of recognizing symmetry
Διαβάστε περισσότερα5.4 The Poisson Distribution.
The worst thing you can do about a situation is nothing. Sr. O Shea Jackson 5.4 The Poisson Distribution. Description of the Poisson Distribution Discrete probability distribution. The random variable
Διαβάστε περισσότεραExample Sheet 3 Solutions
Example Sheet 3 Solutions. i Regular Sturm-Liouville. ii Singular Sturm-Liouville mixed boundary conditions. iii Not Sturm-Liouville ODE is not in Sturm-Liouville form. iv Regular Sturm-Liouville note
Διαβάστε περισσότεραMatrices and Determinants
Matrices and Determinants SUBJECTIVE PROBLEMS: Q 1. For what value of k do the following system of equations possess a non-trivial (i.e., not all zero) solution over the set of rationals Q? x + ky + 3z
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 6/5/2006
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Ολοι οι αριθμοί που αναφέρονται σε όλα τα ερωτήματα είναι μικρότεροι το 1000 εκτός αν ορίζεται διαφορετικά στη διατύπωση του προβλήματος. Διάρκεια: 3,5 ώρες Καλή
Διαβάστε περισσότεραΜηχανική Μάθηση Hypothesis Testing
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Μηχανική Μάθηση Hypothesis Testing Γιώργος Μπορμπουδάκης Τμήμα Επιστήμης Υπολογιστών Procedure 1. Form the null (H 0 ) and alternative (H 1 ) hypothesis 2. Consider
Διαβάστε περισσότεραThe challenges of non-stable predicates
The challenges of non-stable predicates Consider a non-stable predicate Φ encoding, say, a safety property. We want to determine whether Φ holds for our program. The challenges of non-stable predicates
Διαβάστε περισσότεραFinite Field Problems: Solutions
Finite Field Problems: Solutions 1. Let f = x 2 +1 Z 11 [x] and let F = Z 11 [x]/(f), a field. Let Solution: F =11 2 = 121, so F = 121 1 = 120. The possible orders are the divisors of 120. Solution: The
Διαβάστε περισσότεραΑπόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ.
Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο The time integral of a force is referred to as impulse, is determined by and is obtained from: Newton s 2 nd Law of motion states that the action
Διαβάστε περισσότεραApproximation of distance between locations on earth given by latitude and longitude
Approximation of distance between locations on earth given by latitude and longitude Jan Behrens 2012-12-31 In this paper we shall provide a method to approximate distances between two points on earth
Διαβάστε περισσότεραProblem Set 3: Solutions
CMPSCI 69GG Applied Information Theory Fall 006 Problem Set 3: Solutions. [Cover and Thomas 7.] a Define the following notation, C I p xx; Y max X; Y C I p xx; Ỹ max I X; Ỹ We would like to show that C
Διαβάστε περισσότεραLecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3
Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3 1 State vector space and the dual space Space of wavefunctions The space of wavefunctions is the set of all
Διαβάστε περισσότερα3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β
3.4 SUM AND DIFFERENCE FORMULAS Page Theorem cos(αβ cos α cos β -sin α cos(α-β cos α cos β sin α NOTE: cos(αβ cos α cos β cos(α-β cos α -cos β Proof of cos(α-β cos α cos β sin α Let s use a unit circle
Διαβάστε περισσότεραAreas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Διαβάστε περισσότεραInverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- -----------------
Inverse trigonometric functions & General Solution of Trigonometric Equations. 1. Sin ( ) = a) b) c) d) Ans b. Solution : Method 1. Ans a: 17 > 1 a) is rejected. w.k.t Sin ( sin ) = d is rejected. If sin
Διαβάστε περισσότεραHISTOGRAMS AND PERCENTILES What is the 25 th percentile of a histogram? What is the 50 th percentile for the cigarette histogram?
HISTOGRAMS AND PERCENTILES What is the 25 th percentile of a histogram? The point on the horizontal axis such that of the area under the histogram lies to the left of that point (and to the right) What
Διαβάστε περισσότεραPartial Differential Equations in Biology The boundary element method. March 26, 2013
The boundary element method March 26, 203 Introduction and notation The problem: u = f in D R d u = ϕ in Γ D u n = g on Γ N, where D = Γ D Γ N, Γ D Γ N = (possibly, Γ D = [Neumann problem] or Γ N = [Dirichlet
Διαβάστε περισσότεραEvery set of first-order formulas is equivalent to an independent set
Every set of first-order formulas is equivalent to an independent set May 6, 2008 Abstract A set of first-order formulas, whatever the cardinality of the set of symbols, is equivalent to an independent
Διαβάστε περισσότεραΕΙΣΑΓΩΓΗ ΣΤΗ ΣΤΑΤΙΣΤΙΚΗ ΑΝΑΛΥΣΗ
ΕΙΣΑΓΩΓΗ ΣΤΗ ΣΤΑΤΙΣΤΙΚΗ ΑΝΑΛΥΣΗ ΕΛΕΝΑ ΦΛΟΚΑ Επίκουρος Καθηγήτρια Τµήµα Φυσικής, Τοµέας Φυσικής Περιβάλλοντος- Μετεωρολογίας ΓΕΝΙΚΟΙ ΟΡΙΣΜΟΙ Πληθυσµός Σύνολο ατόµων ή αντικειµένων στα οποία αναφέρονται
Διαβάστε περισσότερα4.6 Autoregressive Moving Average Model ARMA(1,1)
84 CHAPTER 4. STATIONARY TS MODELS 4.6 Autoregressive Moving Average Model ARMA(,) This section is an introduction to a wide class of models ARMA(p,q) which we will consider in more detail later in this
Διαβάστε περισσότεραBayesian statistics. DS GA 1002 Probability and Statistics for Data Science.
Bayesian statistics DS GA 1002 Probability and Statistics for Data Science http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall17 Carlos Fernandez-Granda Frequentist vs Bayesian statistics In frequentist
Διαβάστε περισσότεραAreas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Διαβάστε περισσότεραCRASH COURSE IN PRECALCULUS
CRASH COURSE IN PRECALCULUS Shiah-Sen Wang The graphs are prepared by Chien-Lun Lai Based on : Precalculus: Mathematics for Calculus by J. Stuwart, L. Redin & S. Watson, 6th edition, 01, Brooks/Cole Chapter
Διαβάστε περισσότεραFigure A.2: MPC and MPCP Age Profiles (estimating ρ, ρ = 2, φ = 0.03)..
Supplemental Material (not for publication) Persistent vs. Permanent Income Shocks in the Buffer-Stock Model Jeppe Druedahl Thomas H. Jørgensen May, A Additional Figures and Tables Figure A.: Wealth and
Διαβάστε περισσότεραPARTIAL NOTES for 6.1 Trigonometric Identities
PARTIAL NOTES for 6.1 Trigonometric Identities tanθ = sinθ cosθ cotθ = cosθ sinθ BASIC IDENTITIES cscθ = 1 sinθ secθ = 1 cosθ cotθ = 1 tanθ PYTHAGOREAN IDENTITIES sin θ + cos θ =1 tan θ +1= sec θ 1 + cot
Διαβάστε περισσότεραSolution Series 9. i=1 x i and i=1 x i.
Lecturer: Prof. Dr. Mete SONER Coordinator: Yilin WANG Solution Series 9 Q1. Let α, β >, the p.d.f. of a beta distribution with parameters α and β is { Γ(α+β) Γ(α)Γ(β) f(x α, β) xα 1 (1 x) β 1 for < x
Διαβάστε περισσότεραΣυστήματα Διαχείρισης Βάσεων Δεδομένων
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Συστήματα Διαχείρισης Βάσεων Δεδομένων Φροντιστήριο 9: Transactions - part 1 Δημήτρης Πλεξουσάκης Τμήμα Επιστήμης Υπολογιστών Tutorial on Undo, Redo and Undo/Redo
Διαβάστε περισσότεραConcrete Mathematics Exercises from 30 September 2016
Concrete Mathematics Exercises from 30 September 2016 Silvio Capobianco Exercise 1.7 Let H(n) = J(n + 1) J(n). Equation (1.8) tells us that H(2n) = 2, and H(2n+1) = J(2n+2) J(2n+1) = (2J(n+1) 1) (2J(n)+1)
Διαβάστε περισσότερα9.09. # 1. Area inside the oval limaçon r = cos θ. To graph, start with θ = 0 so r = 6. Compute dr
9.9 #. Area inside the oval limaçon r = + cos. To graph, start with = so r =. Compute d = sin. Interesting points are where d vanishes, or at =,,, etc. For these values of we compute r:,,, and the values
Διαβάστε περισσότεραExercises 10. Find a fundamental matrix of the given system of equations. Also find the fundamental matrix Φ(t) satisfying Φ(0) = I. 1.
Exercises 0 More exercises are available in Elementary Differential Equations. If you have a problem to solve any of them, feel free to come to office hour. Problem Find a fundamental matrix of the given
Διαβάστε περισσότεραforms This gives Remark 1. How to remember the above formulas: Substituting these into the equation we obtain with
Week 03: C lassification of S econd- Order L inear Equations In last week s lectures we have illustrated how to obtain the general solutions of first order PDEs using the method of characteristics. We
Διαβάστε περισσότεραNew bounds for spherical two-distance sets and equiangular lines
New bounds for spherical two-distance sets and equiangular lines Michigan State University Oct 8-31, 016 Anhui University Definition If X = {x 1, x,, x N } S n 1 (unit sphere in R n ) and x i, x j = a
Διαβάστε περισσότεραFractional Colorings and Zykov Products of graphs
Fractional Colorings and Zykov Products of graphs Who? Nichole Schimanski When? July 27, 2011 Graphs A graph, G, consists of a vertex set, V (G), and an edge set, E(G). V (G) is any finite set E(G) is
Διαβάστε περισσότεραMath221: HW# 1 solutions
Math: HW# solutions Andy Royston October, 5 7.5.7, 3 rd Ed. We have a n = b n = a = fxdx = xdx =, x cos nxdx = x sin nx n sin nxdx n = cos nx n = n n, x sin nxdx = x cos nx n + cos nxdx n cos n = + sin
Διαβάστε περισσότεραST5224: Advanced Statistical Theory II
ST5224: Advanced Statistical Theory II 2014/2015: Semester II Tutorial 7 1. Let X be a sample from a population P and consider testing hypotheses H 0 : P = P 0 versus H 1 : P = P 1, where P j is a known
Διαβάστε περισσότεραLecture 2: ARMA Models
Leture 2: ARMA Models Bus 41910, Autumn Quarter 2008, Mr Ruey S Tsay Autoregressive Moving-Average (ARMA) models form a lass of linear time series models whih are widely appliable and parsimonious in parameterization
Διαβάστε περισσότεραSecond Order Partial Differential Equations
Chapter 7 Second Order Partial Differential Equations 7.1 Introduction A second order linear PDE in two independent variables (x, y Ω can be written as A(x, y u x + B(x, y u xy + C(x, y u u u + D(x, y
Διαβάστε περισσότεραChapter 6: Systems of Linear Differential. be continuous functions on the interval
Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations
Διαβάστε περισσότεραPhysical DB Design. B-Trees Index files can become quite large for large main files Indices on index files are possible.
B-Trees Index files can become quite large for large main files Indices on index files are possible 3 rd -level index 2 nd -level index 1 st -level index Main file 1 The 1 st -level index consists of pairs
Διαβάστε περισσότεραExample of the Baum-Welch Algorithm
Example of the Baum-Welch Algorithm Larry Moss Q520, Spring 2008 1 Our corpus c We start with a very simple corpus. We take the set Y of unanalyzed words to be {ABBA, BAB}, and c to be given by c(abba)
Διαβάστε περισσότεραFinancial Risk Management
Pricing of American options University of Oulu - Department of Finance Spring 2018 Volatility-based binomial price process uuuus 0 = 26.51 uuus 0 = 24.71 uus 0 = us 0 = S 0 = ds 0 = dds 0 = ddds 0 = 16.19
Διαβάστε περισσότεραSection 7.6 Double and Half Angle Formulas
09 Section 7. Double and Half Angle Fmulas To derive the double-angles fmulas, we will use the sum of two angles fmulas that we developed in the last section. We will let α θ and β θ: cos(θ) cos(θ + θ)
Διαβάστε περισσότεραLecture 34 Bootstrap confidence intervals
Lecture 34 Bootstrap confidence intervals Confidence Intervals θ: an unknown parameter of interest We want to find limits θ and θ such that Gt = P nˆθ θ t If G 1 1 α is known, then P θ θ = P θ θ = 1 α
Διαβάστε περισσότεραInstruction Execution Times
1 C Execution Times InThisAppendix... Introduction DL330 Execution Times DL330P Execution Times DL340 Execution Times C-2 Execution Times Introduction Data Registers This appendix contains several tables
Διαβάστε περισσότεραJesse Maassen and Mark Lundstrom Purdue University November 25, 2013
Notes on Average Scattering imes and Hall Factors Jesse Maassen and Mar Lundstrom Purdue University November 5, 13 I. Introduction 1 II. Solution of the BE 1 III. Exercises: Woring out average scattering
Διαβάστε περισσότεραC.S. 430 Assignment 6, Sample Solutions
C.S. 430 Assignment 6, Sample Solutions Paul Liu November 15, 2007 Note that these are sample solutions only; in many cases there were many acceptable answers. 1 Reynolds Problem 10.1 1.1 Normal-order
Διαβάστε περισσότεραCHAPTER 48 APPLICATIONS OF MATRICES AND DETERMINANTS
CHAPTER 48 APPLICATIONS OF MATRICES AND DETERMINANTS EXERCISE 01 Page 545 1. Use matrices to solve: 3x + 4y x + 5y + 7 3x + 4y x + 5y 7 Hence, 3 4 x 0 5 y 7 The inverse of 3 4 5 is: 1 5 4 1 5 4 15 8 3
Διαβάστε περισσότερα[1] P Q. Fig. 3.1
1 (a) Define resistance....... [1] (b) The smallest conductor within a computer processing chip can be represented as a rectangular block that is one atom high, four atoms wide and twenty atoms long. One
Διαβάστε περισσότεραSCHOOL OF MATHEMATICAL SCIENCES G11LMA Linear Mathematics Examination Solutions
SCHOOL OF MATHEMATICAL SCIENCES GLMA Linear Mathematics 00- Examination Solutions. (a) i. ( + 5i)( i) = (6 + 5) + (5 )i = + i. Real part is, imaginary part is. (b) ii. + 5i i ( + 5i)( + i) = ( i)( + i)
Διαβάστε περισσότεραPotential Dividers. 46 minutes. 46 marks. Page 1 of 11
Potential Dividers 46 minutes 46 marks Page 1 of 11 Q1. In the circuit shown in the figure below, the battery, of negligible internal resistance, has an emf of 30 V. The pd across the lamp is 6.0 V and
Διαβάστε περισσότεραDESIGN OF MACHINERY SOLUTION MANUAL h in h 4 0.
DESIGN OF MACHINERY SOLUTION MANUAL -7-1! PROBLEM -7 Statement: Design a double-dwell cam to move a follower from to 25 6, dwell for 12, fall 25 and dwell for the remader The total cycle must take 4 sec
Διαβάστε περισσότεραVariational Wavefunction for the Helium Atom
Technische Universität Graz Institut für Festkörperphysik Student project Variational Wavefunction for the Helium Atom Molecular and Solid State Physics 53. submitted on: 3. November 9 by: Markus Krammer
Διαβάστε περισσότεραω ω ω ω ω ω+2 ω ω+2 + ω ω ω ω+2 + ω ω+1 ω ω+2 2 ω ω ω ω ω ω ω ω+1 ω ω2 ω ω2 + ω ω ω2 + ω ω ω ω2 + ω ω+1 ω ω2 + ω ω+1 + ω ω ω ω2 + ω
0 1 2 3 4 5 6 ω ω + 1 ω + 2 ω + 3 ω + 4 ω2 ω2 + 1 ω2 + 2 ω2 + 3 ω3 ω3 + 1 ω3 + 2 ω4 ω4 + 1 ω5 ω 2 ω 2 + 1 ω 2 + 2 ω 2 + ω ω 2 + ω + 1 ω 2 + ω2 ω 2 2 ω 2 2 + 1 ω 2 2 + ω ω 2 3 ω 3 ω 3 + 1 ω 3 + ω ω 3 +
Διαβάστε περισσότεραA Bonus-Malus System as a Markov Set-Chain. Małgorzata Niemiec Warsaw School of Economics Institute of Econometrics
A Bonus-Malus System as a Markov Set-Chain Małgorzata Niemiec Warsaw School of Economics Institute of Econometrics Contents 1. Markov set-chain 2. Model of bonus-malus system 3. Example 4. Conclusions
Διαβάστε περισσότεραdepartment listing department name αχχουντσ ϕανε βαλικτ δδσϕηασδδη σδηφγ ασκϕηλκ τεχηνιχαλ αλαν ϕουν διξ τεχηνιχαλ ϕοην µαριανι
She selects the option. Jenny starts with the al listing. This has employees listed within She drills down through the employee. The inferred ER sttricture relates this to the redcords in the databasee
Διαβάστε περισσότεραSolutions to Exercise Sheet 5
Solutions to Eercise Sheet 5 jacques@ucsd.edu. Let X and Y be random variables with joint pdf f(, y) = 3y( + y) where and y. Determine each of the following probabilities. Solutions. a. P (X ). b. P (X
Διαβάστε περισσότεραΑναερόβια Φυσική Κατάσταση
Αναερόβια Φυσική Κατάσταση Γιάννης Κουτεντάκης, BSc, MA. PhD Αναπληρωτής Καθηγητής ΤΕΦΑΑ, Πανεπιστήµιο Θεσσαλίας Περιεχόµενο Μαθήµατος Ορισµός της αναερόβιας φυσικής κατάστασης Σχέσης µε µηχανισµούς παραγωγής
Διαβάστε περισσότερα( ) 2 and compare to M.
Problems and Solutions for Section 4.2 4.9 through 4.33) 4.9 Calculate the square root of the matrix 3!0 M!0 8 Hint: Let M / 2 a!b ; calculate M / 2!b c ) 2 and compare to M. Solution: Given: 3!0 M!0 8
Διαβάστε περισσότερα6.1. Dirac Equation. Hamiltonian. Dirac Eq.
6.1. Dirac Equation Ref: M.Kaku, Quantum Field Theory, Oxford Univ Press (1993) η μν = η μν = diag(1, -1, -1, -1) p 0 = p 0 p = p i = -p i p μ p μ = p 0 p 0 + p i p i = E c 2 - p 2 = (m c) 2 H = c p 2
Διαβάστε περισσότεραNotes on the Open Economy
Notes on the Open Econom Ben J. Heijdra Universit of Groningen April 24 Introduction In this note we stud the two-countr model of Table.4 in more detail. restated here for convenience. The model is Table.4.
Διαβάστε περισσότεραCHAPTER 101 FOURIER SERIES FOR PERIODIC FUNCTIONS OF PERIOD
CHAPTER FOURIER SERIES FOR PERIODIC FUNCTIONS OF PERIOD EXERCISE 36 Page 66. Determine the Fourier series for the periodic function: f(x), when x +, when x which is periodic outside this rge of period.
Διαβάστε περισσότεραProblem Set 9 Solutions. θ + 1. θ 2 + cotθ ( ) sinθ e iφ is an eigenfunction of the ˆ L 2 operator. / θ 2. φ 2. sin 2 θ φ 2. ( ) = e iφ. = e iφ cosθ.
Chemistry 362 Dr Jean M Standard Problem Set 9 Solutions The ˆ L 2 operator is defined as Verify that the angular wavefunction Y θ,φ) Also verify that the eigenvalue is given by 2! 2 & L ˆ 2! 2 2 θ 2 +
Διαβάστε περισσότεραPart III - Pricing A Down-And-Out Call Option
Part III - Pricing A Down-And-Out Call Option Gary Schurman MBE, CFA March 202 In Part I we examined the reflection principle and a scaled random walk in discrete time and then extended the reflection
Διαβάστε περισσότεραMain source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1
Main source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1 A Brief History of Sampling Research 1915 - Edmund Taylor Whittaker (1873-1956) devised a
Διαβάστε περισσότεραSrednicki Chapter 55
Srednicki Chapter 55 QFT Problems & Solutions A. George August 3, 03 Srednicki 55.. Use equations 55.3-55.0 and A i, A j ] = Π i, Π j ] = 0 (at equal times) to verify equations 55.-55.3. This is our third
Διαβάστε περισσότεραModule 5. February 14, h 0min
Module 5 Stationary Time Series Models Part 2 AR and ARMA Models and Their Properties Class notes for Statistics 451: Applied Time Series Iowa State University Copyright 2015 W. Q. Meeker. February 14,
Διαβάστε περισσότεραStrain gauge and rosettes
Strain gauge and rosettes Introduction A strain gauge is a device which is used to measure strain (deformation) on an object subjected to forces. Strain can be measured using various types of devices classified
Διαβάστε περισσότεραΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΤΜΗΜΑ ΝΟΣΗΛΕΥΤΙΚΗΣ
ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΤΜΗΜΑ ΝΟΣΗΛΕΥΤΙΚΗΣ ΠΤΥΧΙΑΚΗ ΕΡΓΑΣΙΑ ΨΥΧΟΛΟΓΙΚΕΣ ΕΠΙΠΤΩΣΕΙΣ ΣΕ ΓΥΝΑΙΚΕΣ ΜΕΤΑ ΑΠΟ ΜΑΣΤΕΚΤΟΜΗ ΓΕΩΡΓΙΑ ΤΡΙΣΟΚΚΑ Λευκωσία 2012 ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΣΧΟΛΗ ΕΠΙΣΤΗΜΩΝ
Διαβάστε περισσότεραLecture 2. Soundness and completeness of propositional logic
Lecture 2 Soundness and completeness of propositional logic February 9, 2004 1 Overview Review of natural deduction. Soundness and completeness. Semantics of propositional formulas. Soundness proof. Completeness
Διαβάστε περισσότεραMean-Variance Analysis
Mean-Variance Analysis Jan Schneider McCombs School of Business University of Texas at Austin Jan Schneider Mean-Variance Analysis Beta Representation of the Risk Premium risk premium E t [Rt t+τ ] R1
Διαβάστε περισσότεραReminders: linear functions
Reminders: linear functions Let U and V be vector spaces over the same field F. Definition A function f : U V is linear if for every u 1, u 2 U, f (u 1 + u 2 ) = f (u 1 ) + f (u 2 ), and for every u U
Διαβάστε περισσότεραMean bond enthalpy Standard enthalpy of formation Bond N H N N N N H O O O
Q1. (a) Explain the meaning of the terms mean bond enthalpy and standard enthalpy of formation. Mean bond enthalpy... Standard enthalpy of formation... (5) (b) Some mean bond enthalpies are given below.
Διαβάστε περισσότεραOn a four-dimensional hyperbolic manifold with finite volume
BULETINUL ACADEMIEI DE ŞTIINŢE A REPUBLICII MOLDOVA. MATEMATICA Numbers 2(72) 3(73), 2013, Pages 80 89 ISSN 1024 7696 On a four-dimensional hyperbolic manifold with finite volume I.S.Gutsul Abstract. In
Διαβάστε περισσότεραForced Pendulum Numerical approach
Numerical approach UiO April 8, 2014 Physical problem and equation We have a pendulum of length l, with mass m. The pendulum is subject to gravitation as well as both a forcing and linear resistance force.
Διαβάστε περισσότεραThe Probabilistic Method - Probabilistic Techniques. Lecture 7: The Janson Inequality
The Probabilistic Method - Probabilistic Techniques Lecture 7: The Janson Inequality Sotiris Nikoletseas Associate Professor Computer Engineering and Informatics Department 2014-2015 Sotiris Nikoletseas,
Διαβάστε περισσότεραSecond Order RLC Filters
ECEN 60 Circuits/Electronics Spring 007-0-07 P. Mathys Second Order RLC Filters RLC Lowpass Filter A passive RLC lowpass filter (LPF) circuit is shown in the following schematic. R L C v O (t) Using phasor
Διαβάστε περισσότεραk A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R +
Chapter 3. Fuzzy Arithmetic 3- Fuzzy arithmetic: ~Addition(+) and subtraction (-): Let A = [a and B = [b, b in R If x [a and y [b, b than x+y [a +b +b Symbolically,we write A(+)B = [a (+)[b, b = [a +b
Διαβάστε περισσότεραHomework 8 Model Solution Section
MATH 004 Homework Solution Homework 8 Model Solution Section 14.5 14.6. 14.5. Use the Chain Rule to find dz where z cosx + 4y), x 5t 4, y 1 t. dz dx + dy y sinx + 4y)0t + 4) sinx + 4y) 1t ) 0t + 4t ) sinx
Διαβάστε περισσότεραSection 9.2 Polar Equations and Graphs
180 Section 9. Polar Equations and Graphs In this section, we will be graphing polar equations on a polar grid. In the first few examples, we will write the polar equation in rectangular form to help identify
Διαβάστε περισσότεραNuclear Physics 5. Name: Date: 8 (1)
Name: Date: Nuclear Physics 5. A sample of radioactive carbon-4 decays into a stable isotope of nitrogen. As the carbon-4 decays, the rate at which the amount of nitrogen is produced A. decreases linearly
Διαβάστε περισσότεραΑΡΙΣΤΟΤΕΛΕΙΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΘΕΣΣΑΛΟΝΙΚΗΣ
ΑΡΙΣΤΟΤΕΛΕΙΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΘΕΣΣΑΛΟΝΙΚΗΣ ΤΜΗΜΑ ΧΗΜΙΚΩΝ ΜΗΧΑΝΙΚΩΝ Εργαστήριο Β Χημικής Μηχανικής Τ.Θ. 472 54124 Θεσσαλονίκη PROCESS DYNAMICS & CONTROL 2014 Final Review Series of Solved Problems Problem 1:
Διαβάστε περισσότεραΕργαστήριο Ανάπτυξης Εφαρμογών Βάσεων Δεδομένων. Εξάμηνο 7 ο
Εργαστήριο Ανάπτυξης Εφαρμογών Βάσεων Δεδομένων Εξάμηνο 7 ο Procedures and Functions Stored procedures and functions are named blocks of code that enable you to group and organize a series of SQL and PL/SQL
Διαβάστε περισσότεραNumerical Analysis FMN011
Numerical Analysis FMN011 Carmen Arévalo Lund University carmen@maths.lth.se Lecture 12 Periodic data A function g has period P if g(x + P ) = g(x) Model: Trigonometric polynomial of order M T M (x) =
Διαβάστε περισσότεραBounding Nonsplitting Enumeration Degrees
Bounding Nonsplitting Enumeration Degrees Thomas F. Kent Andrea Sorbi Università degli Studi di Siena Italia July 18, 2007 Goal: Introduce a form of Σ 0 2-permitting for the enumeration degrees. Till now,
Διαβάστε περισσότεραOverview. Transition Semantics. Configurations and the transition relation. Executions and computation
Overview Transition Semantics Configurations and the transition relation Executions and computation Inference rules for small-step structural operational semantics for the simple imperative language Transition
Διαβάστε περισσότερα