Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

7 . 2 . 1 Various rainbow optionsPut on a basketChar Count = 0 Dynamic 2 D Problems 1 9 7 Data for a put

7.2.1 Various rainbow optionsPut on a basketChar Count=0Dynamic 2D Problems 197 Data for a put on a basketValue181201400.10.00.5 For options on baskets, at present there is no known analytical solution (Hunziker and Koch-Medina, 1996, p.161). Therefore, this option has to be priced with a numerical device or anapproximation (Huynh,1994; Milevsky and Posner, 1998; Zhang, 1998b, Chapter 27). Thebasic idea of these approximations is to combine the volatilities of the underlying and theircorrelations to a single volatility of the basket. This basket is then treated as a single underly-ing. Using this approach, the problem of pricing an option on a basket is reduced to pricingan option on a single equity. Accordingly, the models to price options with exotic featurescan also be applied to options on baskets. Precise error estimates are generally not provided(Hunziker and Koch-Medina, 1996, p.163). Here, however, we price options on baskets usinga multidimensional PDE. For a plain vanilla put we first derive the boundary conditions. Asone or both underlyings become worth much more than the strike, the price of the options goesto zero. As the price of the first underlying is zero, while the second is positive, the value of theoption behaves like the value of a plain vanilla put on a single equity. Therefore, the boundaryconditions at S1=0 and S2=0 are the (time-dependent) solution to the basic BlackScholesproblem of pricing a put (Hunziker and Koch-Medina, 1996, p.162) with strikes at E and w2E , respectively. Together with the data shown in Table 7.1, this becomes the following PDE w1problem.12S22V+12S22V+SS 2V +211 S 12222 S 221212 S 1 S 2(rD)S V +(rD)S V =rVV 11 S122 S2 tV(S1,S2,T)= max(0,E (w1S1+w2S2)) V ( S 1,0, t )= g ( S 1, wE , t )2V(0,S2,t)=g(S2,wE ,t)(7.9)(7.10)(7.11)(7.12)(7.13)(7.14)V(100,S2,t)=0 V(S1,100,t)=01 WY061-07drvWY061-Topper December 19,200411:52 Char Count=0198 Financial Engineering with Finite ElementsTable 7.2 Results for a put option on a basket computed on a square domain VolatilityTime to maturity 0.50.95430.95430.0022%1.47561.47640.0512%2.01862.01870.0041%1.41201.41270.0492%1.88351.88330.0125%2.39412.39420.0024%1.89411.89480.0395%2.33012.32980.0138%2.81122.81190.0021%10.10.20.320.051.80250.11.80650.2204%1.83330.21.83410.0473%1.91180.31.91380.1034%1.82710.11.82750.0236%1.88590.21.88560.0076%1.98160.31.98300.00602%1.89060.11.89150.0451%1.96830.21.96870.0210%2.07390.32.07470.0360%0.950.60430.60350.1352%1.24081.24050.0305%1.92651.92700.0242%1.16071.16010.0489%1.77581.77540.0202%2.43892.43890.0004%1.76491.76470.0108%2.35572.35550.0095%2.99852.99790.0181%PremiumTreeFEM Difference TreeFEM Difference TreeFEM DifferenceTreeFEM Difference TreeFEM Difference TreeFEM DifferenceTreeFEM Difference TreeFEM Difference TreeFEM Difference Ew1et al.(1996). The results are shown in Table 7.2.As an alternative to pricing this option on a square domain, we also price it on a triangle(the results are shown in Table 7.3). Basically, we cut off the section of the domain where the option is totally out of the money and therefore worthless. This, of course, reduces computing time. The boundary conditions (7.11) to (7.14) are replaced by:Here, the g functions denote a plain vanilla European put with strikes E and w2and appropriate volatilities. We compute the cumulative normal distributions in Equations (7.11) and (7.12) with an approximation with four-digit accuracy from Hull (2000). To compare the results, we also price the put on a basket using a two-dimensional binomial tree, as implemented by Haug (1997). This tree can be interpreted as a simple explicit finite difference scheme; see WilmottV(S1,0,t)= g(S1, wE ,t)2V(0,S2,t)=g(S2,wE ,t)1V(S1,S2,t)=0 on SmaxSmax 12(7.15)(7.16)(7.17) WY061-07drvWY061-Topper December 19,200411:52 Char Count=0Dynamic 2D Problems Table 7.3 Results for a put option on a basket computed on a triangular domain VolatilityTime to maturity 0.50.95430.95450.0155%1.47561.47700.0899%2.01862.01870.0053%1.41201.41190.0095%1.88351.88340.0033%2.39412.39400.0044%1.89411.89370.0218%2.33012.32990.0076%2.81202.81200.0006%199PremiumTreeFEM Difference TreeFEM Difference TreeFEM DifferenceTreeFEM Difference TreeFEM Difference TreeFEM DifferenceTreeFEM Difference TreeFEM Difference TreeFEM Difference 10.10.20.320.051.80260.11.80350.0498%1.83330.21.83340.0048%1.91180.31.91350.0919%1.82710.11.82650.0324%1.88590.21.88500.0468%1.98180.31.98260.0426%1.89060.11

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Application Development And Design

Authors: Michael V. Mannino

1st Edition

0072463678, 978-0072463675

More Books

Students also viewed these Databases questions

Question

design a simple performance appraisal system

Answered: 1 week ago