Numerical methods for American options


 Amanda Bryan
 5 years ago
 Views:
Transcription
1 Lecture 9 Numerical methods for American options Lecture Notes by Andrzej Palczewski Computational Finance p. 1
2 American options The holder of an American option has the right to exercise it at any moment up to maturity. If exercised at t an American call option has the payoff (S t K) +, an American put option has the payoff (K S t ) +. Theorem. If the underlying does not pay dividends, the price of an American call option with maturity T and exercise price K is equal to the price of a European call option with exercise price K expiring at T. Important! It is only true if there are no dividends. Above theorem does not apply for options on the foreign exchange market and on stock indices. Computational Finance p. 2
3 American instruments Definition. American type instrument with maturity T and payoff function f is a contingent claim that can be exercised at any moment up to T. Its payoff at t equals f(s t, t). Theorem. The price of an American claim at time t can be written as V (S t, t) for some function V : (0, ) [0, T] R. Computational Finance p. 3
4 Properties V (S t, t) is the price of the instrument at t, so it values future payoffs from the instrument. f(s t, t) is the payoff of the instrument if it is exercised at t. At the terminal time T V (s, T) = f(s, T), s > 0. To preclude arbitrage V (s, t) f(s, t), (s, t) (0, ) [0, T]. Computational Finance p. 4
5 If the inequality is strict, i.e. V (s, t) > f(s, t), the holder should not exercise the option. Because it is more profitable to sell the option for V (s, t) than to exercise it for f(s, t). If V (s, t) = f(s, t), it is optimal to exercise the option immediately. By holding it, the holder risks loosing money. General rule. The holder should exercise the option as soon as V (S t, t) = f(s t, t). Computational Finance p. 5
6 American option PDE Up to the exercise of the option, its price forms a value process of the replicating strategy. It is therefore a martingale with respect to the riskneutral measure. Applying Itô s formula gives dv t = d ( V (S t, t) ) = + ( rs t V (S t, t) s ( σs t V (S t, t) s σ2 S 2 t ) dw t + 2 V (S t, t) s 2 rv (S t, t) + V (S ) t, t) dt. t This process is a martingale if and only if the term by dt is zero. Computational Finance p. 6
7 Until the optimal exercise we have rs V (s, t) s σ2 s 2 2 V (s, t) s 2 rv (s, t) + And of course, we have V (s, t) > f(s, t). At the optimal exercise moment, we have V (s, t) = f(s, t), V (s, t) t = 0. and rs V (s, t) s σ2 s 2 2 V (s, t) s 2 rv (s, t) + V (s, t) t 0. The inequality in the second formula comes from the fact that V (s, t) may not represent the value process of some strategy after the optimal exercise moment. Computational Finance p. 7
8 Freeboundary problem We summarize our findings in the following system of equations and inequalities called the freeboundary problem V (s, t) f(s, t) 1 2 σ2 s 2 2 V (s,t) s 2 + rs V (s,t) s rv (s, t) + V (s,t) t 0 1 V (s, t) = f(s, t) or 2 σ2 s 2 2 V (s,t) s 2 + rs V (s,t) s rv (s, t) + V (s,t) t = 0 boundary conditions... The freeboundary is the set of points where V (s, t) = f(s, t). In these points the system is not governed by the equation with partial derivatives. Computational Finance p. 8
9 Boundary conditions Boundary conditions for the American put option: Terminal condition Leftboundary condition Rightboundary condition V (s, T) = (K s) +. lim V (s, t) = K. s 0 lim V (s, t) = 0. s Computational Finance p. 9
10 Complete freeboundary problem For s > 0, t [0, T]: V (s, t) (K s) σ2 s 2 2 V (s,t) s 2 + rs V (s,t) s rv (s, t) + V (s,t) t 0 V (s, t) = (K s) + 1 or 2 σ2 s 2 2 V (s,t) s 2 + rs V (s,t) s rv (s, t) + V (s,t) t = 0 V (s, T) = (K s) + lim s 0 V (s, t) = K lim s V (s, t) = 0 Computational Finance p. 10
11 Simple example We compute the price of an American put option by a simple numerical method. First we make the following change of variables (the same as for the BlackScholes PDE) x := log s + (r 1 2 σ2 )(T t), τ := σ2 2 (T t), 2τ r(t y(x, τ) := e σ 2 ) V ( 2r x ( e σ 2 1)τ, T 2τ ), σ 2 where x R and τ [ 0, σ2 2 T ]. Computational Finance p. 11
12 Transformation of the problem y(x, τ) e ( 2τ r(t σ 2 ) K e x ( 2r σ 2 1)τ ) +, y τ (x, τ) 2 y x 2 (x, τ) 0, y(x, τ) = e ( 2τ r(t σ 2 ) K e ) + 2r x ( σ 2 1)τ or y t (x, τ) 2 y x 2 (x, τ) = 0, y(x, 0) = e rt (K e x ) +, 2τ r(t lim x y(x, τ) = Ke σ 2 ), lim x y(x, τ) = 0. Computational Finance p. 12
13 Numerical method Grid x (, ), τ [0, 1 2 σ2 T] discretization of time τ: δτ = 1 2 σ2 T N discretization of space x τ ν := ν δτ for ν = 0, 1,...,N x min, x max δx = x max x min M x i := x min + i δx for i = 0, 1,...,M w i,ν denotes the approximation of y(x i, τ ν ) Computational Finance p. 13
14 Finite differences We use explicit method (this is important!). The consequence is a small time step for the algorithm to be stable. Computational Finance p. 14
15 In the node (x i, τ ν+1 ) the expression u 1 = λw i 1,ν + (1 2λ)w i,ν + λw i 1,ν, where λ = δτ (δx) 2, approximates the value of y(x i, τ ν+1 ) in the case of no exercise. If this value is smaller than the payoff from the exercise u 2 = e r(t 2τ ν+1 σ 2 ( ) + ) K e x i ( 2r σ 2 1)τ ν+1 then it is optimal to exercise immediately and w i,ν+1 = u 2. This is written concisely as ( w i,ν+1 = max λw i+1,ν + (1 2λ)w i,ν + λw i 1,ν, e r(t 2τ ν+1 σ 2 ( ) ) + ) K e x i ( 2r σ 2 1)τ ν+1. Computational Finance p. 15
16 Algorithm for an American put option Input: x min, x max, M, N, K, T and the parameters of the model δτ = σ2 T 2N, δx = x max x min M Calculate τ ν, ν = 0,1,..., N, and x i, i = 0, 1,..., M For i = 0, 1,..., M w i,0 = e rt (K e x i) + For ν = 0, 1,..., N 1 w 0,ν+1 = Ke r(t 2τ ν+1 σ 2 ) w M,ν+1 = 0 For i = 1,2,..., M 1 u 1 = λw i+1,ν + (1 2λ)w i,ν + λw i 1,ν u 2 = e r(t 2τ ν+1 σ 2 w i,ν+1 = max(u 1, u 2 ) ) K e x i ( 2r σ 2 1)τ ν+1 + Output: w i,ν for i = 0,1,..., M, ν = 0, 1,..., N Computational Finance p. 16
17 General American instrument For a general American instrument we return to original variables only making the change of time t τ = T t. A general American instrument is characterized by a payoff function g(s, τ). The freeboundary problem for this instrument is given by rs ( V (s,τ) τ V (s,τ) s V (s, τ) g(s, τ) 0, rs V (s,τ) τ V (s,τ) s V (s, 0) = g(s, 0), lim s + V (s, τ) = lim s + g(s, τ). lim s 0 V (s, τ) = lim s 0 g(s, τ). 1 2 σ2 s 2 2 V (s,τ) s 2 + rv (s, τ)) (V (s, τ) g(s, τ) ) = 0, 1 2 σ2 s 2 2 V (s,τ) s 2 + rv (s, τ) 0, This problem is also called the linear complementarity problem for the American instrument defined by a payoff function g(s, τ). Computational Finance p. 17
18 Penalty method There are many numerical methods which solve the linear complementarity problem (LCP). We present here the method called the penalty method. This method is simple and efficient (this is particularly visible for more complicated instruments like barrier options). On the other hand the method is only first order (slow convergence). The basic idea of the penalty method is simple. We replace the linear complementarity problem by the nonlinear PDE V (s, τ) τ = rs V (s, τ) s σ2 s 2 2 V (s, τ) s 2 rv (s, τ)+ρ max ( g(s, τ) V (s, τ) ) where, in the limit as the positive penalty parameter ρ, the solution satisfies V g 0. Computational Finance p. 18
19 Finite difference approximation We use the same grid as for the BlackScholes equation with Vi n approximation to V (s i, τ n ) and gi n an approximation to g(s i, τ n ). denoting an The nonlinear PDE for the penalty method becomes in the discrete version V n+1 i V n i = (1 θ) ( τ ( + θ τ + P n+1 i j=i±1 j=i±1 (γ ij + β ij ) ( ) V n+1 j V n+1 ) i r τv n+1 i (γ ij + β ij ) ( ) Vj n Vi n ) r τv n i ( g n+1 i V n+1 ) i, where the choice of θ gives the implicit (θ = 0) and the CrankNicolson (θ = 1 2 ) scheme. Computational Finance p. 19
20 Finite difference approximation cont. Coefficients from the previous slide are as follows: P n+1 ρ, for V n+1 i < g n+1 i, i = 0, otherwise, γ ij = β ij = σ 2 s 2 i s j s i (s i+1 s i 1 ), rs i (j i) s i+1 s i 1, for σ 2 s i + r(j i) s j s i > 0, ( ) + 2rsi (j i) s i+1 s i 1, otherwise, where j = i ± 1 and ρ is a penalty factor (a large positive number). Computational Finance p. 20
21 Finite difference approximation cont. The numerical algorithm can be written in the concise form ( I + (1 θ) τm + P(V n+1 ) ) V n+1 = (I θ τm)v n + P(V n+1 )g n+1, where V n is a vector with entries Vi n and g n a vector with entries gi n, ( [MV n ] i = (γ ij + β ij ) ( ) Vj n Vi n ) rv n i j=i±1 and P(V n ) is a diagonal matrix with entries [P(V n ρ, for Vi n < gi n )] i,i =, 0, otherwise. Computational Finance p. 21
22 Finite difference approximation cont. Matrix M has the property of strict diagonal dominance. It has positive diagonal and nonpositive offdiagonals with diagonal entries strictly dominating sum of absolute values of offdiagonal entries. This property of M is essential for the convergence of the method and is visible from the structure of the upper left corner of the matrix M = 0 r + γ 12 + β 12 γ 12 β γ 21 β 21 r + γ 21 + β 21 + γ 23 + β 23 γ 23 β C A, Note that in the vector on the right hand side (I θ τm)v n the first and the last elements have to be modified to take into account the boundary conditions. Computational Finance p. 22
23 Convergence Theorem. Let us assume that γ ij + β ij 0, ( 2 θ τ j=i±1 τ s < const. τ, s 0, where s = min i (s i+1 s i ). ) (γ ij + β ij ) + r τ 0, Computational Finance p. 23
24 Convergence cont. Then the numerical scheme for the LCP from the previous slides solves V (s, τ) τ rs V (s, τ) s V n+1 i g n+1 i C ρ, C > 0, ( V (s, τ) V (s, τ) rs τ ( V n+1 s i g n+1 i C ρ 1 2 σ2 s 2 2 V (s, τ) s 2 + rv (s, τ) 0, 1 2 σ2 s 2 2 V (s, τ) ), where C is independent of ρ, τ and S. ) s 2 + rv (s, τ) = 0 Computational Finance p. 24
25 Iterative solution Since we get a nonlinear equation for V n+1 it has to be solved by iterations. We shall use here the simple iteration method. Let (V n+1 ) (k) be the kth estimate for V n+1. For notational convenience, we write V (k) (V n+1 ) (k) and P (k) P ( (V n+1 ) (k)). If V (0) = V n, then we have the following algorithm of Penalty American Constraint Iteration. Computational Finance p. 25
26 Algorithm Input: V n, tolerance tol. V (0) = V n For k = 0,... until convergence solvè I + (1 θ) τm + P (k) ) V (k+1) = (I θ τm)v n + P (k) g n+1. If V (k+1) i max i V (k) i max(1, V (k+1) i or P (k+1) = P (k) quit. V n+1 = V (k+1) ) < tol Output: V n+1 Computational Finance p. 26
27 Convergence of iterations Theorem. Let γ ij + β ij 0, then the nonlinear iteration converges to the unique solution to the numerical algorithm of the penalized problem for any initial iterate V (0) ; the iterates converge monotonically, i.e., V (k+1) V (k) for k 1; the iteration has finite termination; i.e. for an iterate sufficiently close to the solution of the penalized problem, convergence is obtained in one step Computational Finance p. 27
28 Size of ρ In theory, if we are taking the limit as s, τ 0, then we should have ( ) 1 ρ = O min ( ( s) 2, ( τ) 2). This means that any error in the penalized formulation tends to zero at the same rate as the discretization error. However, in practice it seems easier to specify the value of ρ in terms of the required accuracy. Then we should take ρ 1 tol. Computational Finance p. 28
29 Speed up iterates convergence Although the simple iterates converge to the solution of the nonlinear problem its speed of convergence is rather slow. To make the convergence more rapid we can use the Newton iterates. This requires to write the nonlinear equation in the form F(x) = 0 and solve the iterative procedure where F (x) is the Jacobian of F. x k+1 = x k F (x k ) 1 F(x k ), In the penalty method algorithm the only nonlinear term which requires differentiation in order to obtain F is Pi n. Unfortunately, this term is discontinuous. A good convergence can be obtained when we define the derivative of the penalty term as P n+1 i (g n+1 i V n+1 i ) V n+1 i = ρ, for V n+1 i < g n+1 0, otherwise. i, Computational Finance p. 29
30 American call option Solving linear complementarity problem for an American call option we have to impose a boundary condition on artificial boundary S max. Let us recall that for an Europen call option the suggested boundary condition is (S max Ke r(t t)) + or for a stock paying dividend of constant rate d ( S max e d(t t) Ke r(t t)) +. Due to the early exercise possibility for an American call option the boundary condition on artificial boundary S max should be ( S max K) +. Computational Finance p. 30
31 American call option cont. For large S max and r > 0 we have ( ) + ( S max K < S max Ke r(t t)) +. Hence for large S, the price of an American call option is smaller than the price of an European call option, which contradicts the theorem that these prices are equal. The problem comes from the replacement of an original boundary condition for S by a condition at artificial boundary S max. To avoid the problem we should impose the following boundary condition at S max ( ) +, ( max( S max K S max e d(t t) Ke r(t t)) ) +. Computational Finance p. 31
32 American barrier options Contrary to European barrier options for American barrier options we do not have inout parity. In general, the sum of prices of knockin and knockout options is not equal to the price of the corresponding American vanilla option. Let τ (D) X = inf{t T : S t X} τ (U) X = inf{t T : S t X} be the first time the price of the underlying asset falls below (rise above) the barrier X. Then for options with payoff g(s t, t) we have [ ] [ ] sup E e rτ 1 g(s τ1, τ 1 )1 {τ1 + sup E e rτ 2 g(s <τ ( ) τ 1 T X } τ2, τ 2 )1 {τ2 >τ ( ) 0,T τ 2 T X } 0,T [ ] sup E e rτ 3 g(s τ3, τ 3 ) τ 3 T 0,T and the equality holds only when all stopping times τ 1, τ 2 and τ 3 are equal. Computational Finance p. 32
33 Downandin option. American knockin options The option condition is: when the asset price S t falls below X the holder of the option receives an American vanilla option, with maturity date T and strike price K. To price that option we consider only the interval [X, + ). In this interval there is no early exercise possibility and we gave an European option which fulfils the BlackScholes equation V (S, t) t + rs with terminal condition and boundary conditions V (S, t) S σ2 S 2 2 V (S, t) S 2 rv (S, t) = 0. V (S, T) = 0 for S > X. V (S, t) 0 as S, V (X, t) = C(X, t), where C(S, t) is the price of the corresponding American vanila option. Computational Finance p. 33
34 American knockin options cont. Upandin option. The option condition is: when the asset price S t rises above X the holder of the option receives an American vanilla option, with maturity date T and strike price K. We price the option in the interval [0, X]. In this interval there is no early exercise possibility and we gave an European option which fulfils the BlackScholes equation with terminal condition and boundary conditions V (S, T) = 0 for S < X. V (S, t) 0 as S 0, V (X, t) = C(X, t), where C(S, t) is the price of the corresponding American vanila option. Computational Finance p. 34
35 American knockout options These options are options with early exercise provision. Terminal conditions are as for American vanila options modified by limitations coming from boundary conditions. Boundary conditions: Downandout option V (S, t) = h(x, t), for S = X, V (S, t) = boundary value for vanila option, for S > X. Upandout option V (S, t) = boundary value for vanila option, for S < X, V (S, t) = h(x, t), for S = X. Here h(x, t) is a payoff function on barrier X (see the next slide). Computational Finance p. 35
36 American knockout options cont. From both financial and mathematical point of view, payoff function h(x, t) is equal to zero. But before the stock price crosses the trigger X, the American option is active and its price must be no less than the option s payoff function g(s t, t) ((S t K) + for call option and (K S t ) + for put option). Hence, up to the barrier the price of the option must be bounded from below by the payoff function g(s t, t). Assuming h(x, t) = 0 will create a jump on the barrier since before the stock price crosses the trigger X the price V (S, t) g(s, t). If the option price is continuous up to the barrier then we shall get V (X, t) g(x, t). That suggests to take as the payoff function on the barrier h(x, t) = g(x, t). This choice does not change the resulting price V (S, t) but has obvious numerical adventage: we do not solve a problem with jumps on a boundary. As a result we obtain a numerical algorithm which is more stable (jumps on a boundary can create oscillations in numerical solutions). Computational Finance p. 36
Lecture 6 BlackScholes PDE
Lecture 6 BlackScholes PDE Lecture Notes by Andrzej Palczewski Computational Finance p. 1 Pricing function Let the dynamics of underlining S t be given in the riskneutral measure Q by If the contingent
More informationNumerical PDE methods for exotic options
Lecture 8 Numerical PDE methods for exotic options Lecture Notes by Andrzej Palczewski Computational Finance p. 1 Barrier options For barrier option part of the option contract is triggered if the asset
More informationFinite Differences Schemes for Pricing of European and American Options
Finite Differences Schemes for Pricing of European and American Options Margarida Mirador Fernandes IST Technical University of Lisbon Lisbon, Portugal November 009 Abstract Starting with the BlackScholes
More informationMore Exotic Options. 1 Barrier Options. 2 Compound Options. 3 Gap Options
More Exotic Options 1 Barrier Options 2 Compound Options 3 Gap Options More Exotic Options 1 Barrier Options 2 Compound Options 3 Gap Options Definition; Some types The payoff of a Barrier option is path
More informationAdditional questions for chapter 4
Additional questions for chapter 4 1. A stock price is currently $ 1. Over the next two sixmonth periods it is expected to go up by 1% or go down by 1%. The riskfree interest rate is 8% per annum with
More informationThe Evaluation of Barrier Option Prices Under Stochastic Volatility. BFS 2010 Hilton, Toronto June 24, 2010
The Evaluation of Barrier Option Prices Under Stochastic Volatility Carl Chiarella, Boda Kang and Gunter H. Meyer School of Finance and Economics University of Technology, Sydney School of Mathematics
More informationValuation of American Options
Valuation of American Options Among the seminal contributions to the mathematics of finance is the paper F. Black and M. Scholes, The pricing of options and corporate liabilities, Journal of Political
More informationPricing Barrier Option Using Finite Difference Method and MonteCarlo Simulation
Pricing Barrier Option Using Finite Difference Method and MonteCarlo Simulation Yoon W. Kwon CIMS 1, Math. Finance Suzanne A. Lewis CIMS, Math. Finance May 9, 000 1 Courant Institue of Mathematical Science,
More informationNumerical Methods for Option Pricing
Chapter 9 Numerical Methods for Option Pricing Equation (8.26) provides a way to evaluate option prices. For some simple options, such as the European call and put options, one can integrate (8.26) directly
More informationBarrier Options. Peter Carr
Barrier Options Peter Carr Head of Quantitative Financial Research, Bloomberg LP, New York Director of the Masters Program in Math Finance, Courant Institute, NYU March 14th, 2008 What are Barrier Options?
More informationPricing Parisian Options
Pricing Parisian Options Richard J. Haber Mathematical Institute, 2429 St Giles, Oxford OX1 3LB Philipp J. Schönbucher University of Bonn, Statistical Department, Adenaueralle 2442, 53113 Bonn, Germany
More informationTABLE OF CONTENTS. A. PutCall Parity 1 B. Comparing Options with Respect to Style, Maturity, and Strike 13
TABLE OF CONTENTS 1. McDonald 9: "Parity and Other Option Relationships" A. PutCall Parity 1 B. Comparing Options with Respect to Style, Maturity, and Strike 13 2. McDonald 10: "Binomial Option Pricing:
More informationLECTURE 15: AMERICAN OPTIONS
LECTURE 15: AMERICAN OPTIONS 1. Introduction All of the options that we have considered thus far have been of the European variety: exercise is permitted only at the termination of the contract. These
More informationOption Pricing. Chapter 9  Barrier Options  Stefan Ankirchner. University of Bonn. last update: 9th December 2013
Option Pricing Chapter 9  Barrier Options  Stefan Ankirchner University of Bonn last update: 9th December 2013 Stefan Ankirchner Option Pricing 1 Standard barrier option Agenda What is a barrier option?
More informationExample 1. Consider the following two portfolios: 2. Buy one c(s(t), 20, τ, r) and sell one c(s(t), 10, τ, r).
Chapter 4 PutCall Parity 1 Bull and Bear Financial analysts use words such as bull and bear to describe the trend in stock markets. Generally speaking, a bull market is characterized by rising prices.
More informationPricing Barrier Options under Local Volatility
Abstract Pricing Barrier Options under Local Volatility Artur Sepp Mail: artursepp@hotmail.com, Web: www.hot.ee/seppar 16 November 2002 We study pricing under the local volatility. Our research is mainly
More informationMoreover, under the risk neutral measure, it must be the case that (5) r t = µ t.
LECTURE 7: BLACK SCHOLES THEORY 1. Introduction: The Black Scholes Model In 1973 Fisher Black and Myron Scholes ushered in the modern era of derivative securities with a seminal paper 1 on the pricing
More information1.1 Some General Relations (for the no dividend case)
1 American Options Most traded stock options and futures options are of Americantype while most index options are of Europeantype. The central issue is when to exercise? From the holder point of view,
More informationPricing European Barrier Options with Partial Differential Equations
Pricing European Barrier Options with Partial Differential Equations Akinyemi David Supervised by: Dr. Alili Larbi Erasmus Mundus Masters in Complexity Science, Complex Systems Science, University of Warwick
More informationValuation, Pricing of Options / Use of MATLAB
CS5 Computational Tools and Methods in Finance Tom Coleman Valuation, Pricing of Options / Use of MATLAB 1.0 PutCall Parity (review) Given a European option with no dividends, let t current time T exercise
More informationOn BlackScholes Equation, Black Scholes Formula and Binary Option Price
On BlackScholes Equation, Black Scholes Formula and Binary Option Price Abstract: Chi Gao 12/15/2013 I. BlackScholes Equation is derived using two methods: (1) riskneutral measure; (2)  hedge. II.
More informationMathematical Finance
Mathematical Finance Option Pricing under the RiskNeutral Measure Cory Barnes Department of Mathematics University of Washington June 11, 2013 Outline 1 Probability Background 2 Black Scholes for European
More informationPricing Options with Discrete Dividends by High Order Finite Differences and Grid Stretching
Pricing Options with Discrete Dividends by High Order Finite Differences and Grid Stretching Kees Oosterlee Numerical analysis group, Delft University of Technology Joint work with Coen Leentvaar, Ariel
More informationA SNOWBALL CURRENCY OPTION
J. KSIAM Vol.15, No.1, 31 41, 011 A SNOWBALL CURRENCY OPTION GYOOCHEOL SHIM 1 1 GRADUATE DEPARTMENT OF FINANCIAL ENGINEERING, AJOU UNIVERSITY, SOUTH KOREA Email address: gshim@ajou.ac.kr ABSTRACT. I introduce
More informationHedging. An Undergraduate Introduction to Financial Mathematics. J. Robert Buchanan. J. Robert Buchanan Hedging
Hedging An Undergraduate Introduction to Financial Mathematics J. Robert Buchanan 2010 Introduction Definition Hedging is the practice of making a portfolio of investments less sensitive to changes in
More informationThe BlackScholes pricing formulas
The BlackScholes pricing formulas Moty Katzman September 19, 2014 The BlackScholes differential equation Aim: Find a formula for the price of European options on stock. Lemma 6.1: Assume that a stock
More informationPricing Formula for 3Period Discrete Barrier Options
Pricing Formula for 3Period Discrete Barrier Options ChunYuan Chiu DownandOut Call Options We first give the pricing formula as an integral and then simplify the integral to obtain a formula similar
More informationS 1 S 2. Options and Other Derivatives
Options and Other Derivatives The OnePeriod Model The previous chapter introduced the following two methods: Replicate the option payoffs with known securities, and calculate the price of the replicating
More informationThe Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
More informationwhere N is the standard normal distribution function,
The BlackScholesMerton formula (Hull 13.5 13.8) Assume S t is a geometric Brownian motion w/drift. Want market value at t = 0 of call option. European call option with expiration at time T. Payout at
More informationHedging Options In The Incomplete Market With Stochastic Volatility. Rituparna Sen Sunday, Nov 15
Hedging Options In The Incomplete Market With Stochastic Volatility Rituparna Sen Sunday, Nov 15 1. Motivation This is a pure jump model and hence avoids the theoretical drawbacks of continuous path models.
More informationLecture 15. Sergei Fedotov. 20912  Introduction to Financial Mathematics. Sergei Fedotov (University of Manchester) 20912 2010 1 / 6
Lecture 15 Sergei Fedotov 20912  Introduction to Financial Mathematics Sergei Fedotov (University of Manchester) 20912 2010 1 / 6 Lecture 15 1 BlackScholes Equation and Replicating Portfolio 2 Static
More informationOptions Markets: Introduction
Options Markets: Introduction Chapter 20 Option Contracts call option = contract that gives the holder the right to purchase an asset at a specified price, on or before a certain date put option = contract
More informationOption Properties. Liuren Wu. Zicklin School of Business, Baruch College. Options Markets. (Hull chapter: 9)
Option Properties Liuren Wu Zicklin School of Business, Baruch College Options Markets (Hull chapter: 9) Liuren Wu (Baruch) Option Properties Options Markets 1 / 17 Notation c: European call option price.
More informationMathematical finance and linear programming (optimization)
Mathematical finance and linear programming (optimization) Geir Dahl September 15, 2009 1 Introduction The purpose of this short note is to explain how linear programming (LP) (=linear optimization) may
More informationPathdependent options
Chapter 5 Pathdependent options The contracts we have seen so far are the most basic and important derivative products. In this chapter, we shall discuss some complex contracts, including barrier options,
More informationMartingale Pricing Applied to Options, Forwards and Futures
IEOR E4706: Financial Engineering: DiscreteTime Asset Pricing Fall 2005 c 2005 by Martin Haugh Martingale Pricing Applied to Options, Forwards and Futures We now apply martingale pricing theory to the
More informationMonte Carlo Methods in Finance
Author: Yiyang Yang Advisor: Pr. Xiaolin Li, Pr. Zari Rachev Department of Applied Mathematics and Statistics State University of New York at Stony Brook October 2, 2012 Outline Introduction 1 Introduction
More informationNumerical Methods for Pricing Exotic Options
Imperial College London Department of Computing Numerical Methods for Pricing Exotic Options by Hardik Dave  00517958 Supervised by Dr. Daniel Kuhn Second Marker: Professor Berç Rustem Submitted in partial
More informationEuropean Call Option Pricing using the Adomian Decomposition Method
Advances in Dynamical Systems and Applications ISSN 09735321, Volume 9, Number 1, pp. 75 85 (2014) http://campus.mst.edu/adsa European Call Option Pricing using the Adomian Decomposition Method Martin
More informationLecture 3: Linear methods for classification
Lecture 3: Linear methods for classification Rafael A. Irizarry and Hector Corrada Bravo February, 2010 Today we describe four specific algorithms useful for classification problems: linear regression,
More informationThe Heston Model. Hui Gong, UCL http://www.homepages.ucl.ac.uk/ ucahgon/ May 6, 2014
Hui Gong, UCL http://www.homepages.ucl.ac.uk/ ucahgon/ May 6, 2014 Generalized SV models Vanilla Call Option via Heston Itô s lemma for variance process EulerMaruyama scheme Implement in Excel&VBA 1.
More informationARBITRAGEFREE OPTION PRICING MODELS. Denis Bell. University of North Florida
ARBITRAGEFREE OPTION PRICING MODELS Denis Bell University of North Florida Modelling Stock Prices Example American Express In mathematical finance, it is customary to model a stock price by an (Ito) stochatic
More informationLecture 10. Finite difference and finite element methods. Option pricing Sensitivity analysis Numerical examples
Finite difference and finite element methods Lecture 10 Sensitivities and Greeks Key task in financial engineering: fast and accurate calculation of sensitivities of market models with respect to model
More informationPricing of an Exotic Forward Contract
Pricing of an Exotic Forward Contract Jirô Akahori, Yuji Hishida and Maho Nishida Dept. of Mathematical Sciences, Ritsumeikan University 111 Nojihigashi, Kusatsu, Shiga 5258577, Japan Email: {akahori,
More informationCS 522 Computational Tools and Methods in Finance Robert Jarrow Lecture 1: Equity Options
CS 5 Computational Tools and Methods in Finance Robert Jarrow Lecture 1: Equity Options 1. Definitions Equity. The common stock of a corporation. Traded on organized exchanges (NYSE, AMEX, NASDAQ). A common
More informationSimulating Stochastic Differential Equations
Monte Carlo Simulation: IEOR E473 Fall 24 c 24 by Martin Haugh Simulating Stochastic Differential Equations 1 Brief Review of Stochastic Calculus and Itô s Lemma Let S t be the time t price of a particular
More informationDoes BlackScholes framework for Option Pricing use Constant Volatilities and Interest Rates? New Solution for a New Problem
Does BlackScholes framework for Option Pricing use Constant Volatilities and Interest Rates? New Solution for a New Problem Gagan Deep Singh Assistant Vice President Genpact Smart Decision Services Financial
More informationBINOMIAL OPTIONS PRICING MODEL. Mark Ioffe. Abstract
BINOMIAL OPTIONS PRICING MODEL Mark Ioffe Abstract Binomial option pricing model is a widespread numerical method of calculating price of American options. In terms of applied mathematics this is simple
More informationLecture. S t = S t δ[s t ].
Lecture In real life the vast majority of all traded options are written on stocks having at least one dividend left before the date of expiration of the option. Thus the study of dividends is important
More informationFinance 400 A. Penati  G. Pennacchi. Option Pricing
Finance 400 A. Penati  G. Pennacchi Option Pricing Earlier we derived general pricing relationships for contingent claims in terms of an equilibrium stochastic discount factor or in terms of elementary
More informationRisk/Arbitrage Strategies: An Application to Stock Option Portfolio Management
Risk/Arbitrage Strategies: An Application to Stock Option Portfolio Management Vincenzo Bochicchio, Niklaus Bühlmann, Stephane Junod and HansFredo List Swiss Reinsurance Company Mythenquai 50/60, CH8022
More informationLecture 3: Put Options and DistributionFree Results
OPTIONS and FUTURES Lecture 3: Put Options and DistributionFree Results Philip H. Dybvig Washington University in Saint Louis put options binomial valuation what are distributionfree results? option
More information1 The BlackScholes model: extensions and hedging
1 The BlackScholes model: extensions and hedging 1.1 Dividends Since we are now in a continuous time framework the dividend paid out at time t (or t ) is given by dd t = D t D t, where as before D denotes
More information7: The CRR Market Model
Ben Goldys and Marek Rutkowski School of Mathematics and Statistics University of Sydney MATH3075/3975 Financial Mathematics Semester 2, 2015 Outline We will examine the following issues: 1 The CoxRossRubinstein
More informationENGINEERING AND HEDGING OF CORRIDOR PRODUCTS  with focus on FX linked instruments 
AARHUS SCHOOL OF BUSINESS AARHUS UNIVERSITY MASTER THESIS ENGINEERING AND HEDGING OF CORRIDOR PRODUCTS  with focus on FX linked instruments  AUTHORS: DANIELA ZABRE GEORGE RARES RADU SIMIAN SUPERVISOR:
More informationLecture 5: Put  Call Parity
Lecture 5: Put  Call Parity Reading: J.C.Hull, Chapter 9 Reminder: basic assumptions 1. There are no arbitrage opportunities, i.e. no party can get a riskless profit. 2. Borrowing and lending are possible
More informationOption Pricing. Chapter 12  Local volatility models  Stefan Ankirchner. University of Bonn. last update: 13th January 2014
Option Pricing Chapter 12  Local volatility models  Stefan Ankirchner University of Bonn last update: 13th January 2014 Stefan Ankirchner Option Pricing 1 Agenda The volatility surface Local volatility
More informationLectures. Sergei Fedotov. 20912  Introduction to Financial Mathematics. No tutorials in the first week
Lectures Sergei Fedotov 20912  Introduction to Financial Mathematics No tutorials in the first week Sergei Fedotov (University of Manchester) 20912 2010 1 / 1 Lecture 1 1 Introduction Elementary economics
More informationModern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
More informationOption Pricing. Chapter 4 Including dividends in the BS model. Stefan Ankirchner. University of Bonn. last update: 6th November 2013
Option Pricing Chapter 4 Including dividends in the BS model Stefan Ankirchner University of Bonn last update: 6th November 2013 Stefan Ankirchner Option Pricing 1 Dividend payments So far: we assumed
More informationGenOpt (R) Generic Optimization Program User Manual Version 3.0.0β1
(R) User Manual Environmental Energy Technologies Division Berkeley, CA 94720 http://simulationresearch.lbl.gov Michael Wetter MWetter@lbl.gov February 20, 2009 Notice: This work was supported by the U.S.
More information10.2 Series and Convergence
10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and
More informationOptions/1. Prof. Ian Giddy
Options/1 New York University Stern School of Business Options Prof. Ian Giddy New York University Options Puts and Calls PutCall Parity Combinations and Trading Strategies Valuation Hedging Options2
More informationOption Pricing. Chapter 11 Options on Futures. Stefan Ankirchner. University of Bonn. last update: 13/01/2014 at 14:25
Option Pricing Chapter 11 Options on Futures Stefan Ankirchner University of Bonn last update: 13/01/2014 at 14:25 Stefan Ankirchner Option Pricing 1 Agenda Forward contracts Definition Determining forward
More information24. The Branch and Bound Method
24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NPcomplete. Then one can conclude according to the present state of science that no
More informationA SemiLagrangian Approach for Natural Gas Storage Valuation and Optimal Operation
A SemiLagrangian Approach for Natural Gas Storage Valuation and Optimal Operation Zhuliang Chen Peter A. Forsyth October 2, 2006 Abstract The valuation of a gas storage facility is characterized as a
More informationStock Loans in Incomplete Markets
Applied Mathematical Finance, 2013 Vol. 20, No. 2, 118 136, http://dx.doi.org/10.1080/1350486x.2012.660318 Stock Loans in Incomplete Markets MATHEUS R. GRASSELLI* & CESAR GÓMEZ** *Department of Mathematics
More informationOptions: Valuation and (No) Arbitrage
Prof. Alex Shapiro Lecture Notes 15 Options: Valuation and (No) Arbitrage I. Readings and Suggested Practice Problems II. Introduction: Objectives and Notation III. No Arbitrage Pricing Bound IV. The Binomial
More informationChapter 11 Options. Main Issues. Introduction to Options. Use of Options. Properties of Option Prices. Valuation Models of Options.
Chapter 11 Options Road Map Part A Introduction to finance. Part B Valuation of assets, given discount rates. Part C Determination of riskadjusted discount rate. Part D Introduction to derivatives. Forwards
More informationPricing Formulae for Foreign Exchange Options 1
Pricing Formulae for Foreign Exchange Options Andreas Weber and Uwe Wystup MathFinance AG Waldems, Germany www.mathfinance.com 22 December 2009 We would like to thank Peter Pong who pointed out an error
More informationLecture 11. Sergei Fedotov. 20912  Introduction to Financial Mathematics. Sergei Fedotov (University of Manchester) 20912 2010 1 / 7
Lecture 11 Sergei Fedotov 20912  Introduction to Financial Mathematics Sergei Fedotov (University of Manchester) 20912 2010 1 / 7 Lecture 11 1 American Put Option Pricing on Binomial Tree 2 Replicating
More informationComputation of implied dividend based on option market data. Qi Cao
Computation of implied dividend based on option market data Qi Cao September 26, 2005 I really appreciate the the help from my superviser Kees Oosterlee, my Colleagues Ariel Almendral, Jasper Anderluh,
More informationThe BlackScholesMerton Approach to Pricing Options
he BlackScholesMerton Approach to Pricing Options Paul J Atzberger Comments should be sent to: atzberg@mathucsbedu Introduction In this article we shall discuss the BlackScholesMerton approach to determining
More informationDouble Barrier Cash or Nothing Options: a short note
Double Barrier Cash or Nothing Options: a short note Antonie Kotzé and Angelo Joseph May 2009 Financial Chaos Theory, Johannesburg, South Africa Mail: consultant@quantonline.co.za Abstract In this note
More informationOption Pricing. 1 Introduction. Mrinal K. Ghosh
Option Pricing Mrinal K. Ghosh 1 Introduction We first introduce the basic terminology in option pricing. Option: An option is the right, but not the obligation to buy (or sell) an asset under specified
More informationLecture 11: The Greeks and Risk Management
Lecture 11: The Greeks and Risk Management This lecture studies market risk management from the perspective of an options trader. First, we show how to describe the risk characteristics of derivatives.
More informationSensitivity Analysis of Options. c 2008 Prof. YuhDauh Lyuu, National Taiwan University Page 264
Sensitivity Analysis of Options c 2008 Prof. YuhDauh Lyuu, National Taiwan University Page 264 Cleopatra s nose, had it been shorter, the whole face of the world would have been changed. Blaise Pascal
More informationBarrier Options. 0.1 Introduction
Barrier Options This note is several years old and very preliminary. It has no references to the literature. Do not trust its accuracy! Note that there is a lot of more recent literature, especially on
More informationOption Valuation. Chapter 21
Option Valuation Chapter 21 Intrinsic and Time Value intrinsic value of inthemoney options = the payoff that could be obtained from the immediate exercise of the option for a call option: stock price
More informationA Newton method for American option pricing
First proof Typesetter: RH March 1, 00 A Newton method for American option pricing Thomas F. Coleman,Yuying Li and Arun Verma Computer Science Department and Cornell Theory Center, Cornell University,
More informationStochastic Inventory Control
Chapter 3 Stochastic Inventory Control 1 In this chapter, we consider in much greater details certain dynamic inventory control problems of the type already encountered in section 1.3. In addition to the
More informationSensitivity analysis of utility based prices and risktolerance wealth processes
Sensitivity analysis of utility based prices and risktolerance wealth processes Dmitry Kramkov, Carnegie Mellon University Based on a paper with Mihai Sirbu from Columbia University Math Finance Seminar,
More informationHedging Barriers. Liuren Wu. Zicklin School of Business, Baruch College (http://faculty.baruch.cuny.edu/lwu/)
Hedging Barriers Liuren Wu Zicklin School of Business, Baruch College (http://faculty.baruch.cuny.edu/lwu/) Based on joint work with Peter Carr (Bloomberg) Modeling and Hedging Using FX Options, March
More informationGenerating Random Numbers Variance Reduction QuasiMonte Carlo. Simulation Methods. Leonid Kogan. MIT, Sloan. 15.450, Fall 2010
Simulation Methods Leonid Kogan MIT, Sloan 15.450, Fall 2010 c Leonid Kogan ( MIT, Sloan ) Simulation Methods 15.450, Fall 2010 1 / 35 Outline 1 Generating Random Numbers 2 Variance Reduction 3 QuasiMonte
More informationLecture 7: Bounds on Options Prices Steven Skiena. http://www.cs.sunysb.edu/ skiena
Lecture 7: Bounds on Options Prices Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794 4400 http://www.cs.sunysb.edu/ skiena Option Price Quotes Reading the
More informationPricing Options Using Trinomial Trees
Pricing Options Using Trinomial Trees Paul Clifford Oleg Zaboronski 17.11.2008 1 Introduction One of the first computational models used in the financial mathematics community was the binomial tree model.
More informationValuation of the Surrender Option Embedded in EquityLinked Life Insurance. Brennan Schwartz (1976,1979) Brennan Schwartz
Valuation of the Surrender Option Embedded in EquityLinked Life Insurance Brennan Schwartz (976,979) Brennan Schwartz 04 2005 6. Introduction Compared to traditional insurance products, one distinguishing
More informationEquilibria and Dynamics of. Supply Chain Network Competition with Information Asymmetry. and Minimum Quality Standards
Equilibria and Dynamics of Supply Chain Network Competition with Information Asymmetry in Quality and Minimum Quality Standards Anna Nagurney John F. Smith Memorial Professor and Dong (Michelle) Li Doctoral
More informationCyberSecurity Analysis of State Estimators in Power Systems
CyberSecurity Analysis of State Estimators in Electric Power Systems André Teixeira 1, Saurabh Amin 2, Henrik Sandberg 1, Karl H. Johansson 1, and Shankar Sastry 2 ACCESS Linnaeus Centre, KTHRoyal Institute
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationChapter 13 The BlackScholesMerton Model
Chapter 13 The BlackScholesMerton Model March 3, 009 13.1. The BlackScholes option pricing model assumes that the probability distribution of the stock price in one year(or at any other future time)
More informationVariance Reduction. Pricing American Options. Monte Carlo Option Pricing. Delta and Common Random Numbers
Variance Reduction The statistical efficiency of Monte Carlo simulation can be measured by the variance of its output If this variance can be lowered without changing the expected value, fewer replications
More informationCHAPTER 5 American Options
CHAPTER 5 American Options The distinctive feature of an American option is its early exercise privilege, that is, the holder can exercise the option prior to the date of expiration. Since the additional
More informationCall and Put. Options. American and European Options. Option Terminology. Payoffs of European Options. Different Types of Options
Call and Put Options A call option gives its holder the right to purchase an asset for a specified price, called the strike price, on or before some specified expiration date. A put option gives its holder
More informationTHE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING
THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING 1. Introduction The BlackScholes theory, which is the main subject of this course and its sequel, is based on the Efficient Market Hypothesis, that arbitrages
More informationLecture 7: Finding Lyapunov Functions 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 7: Finding Lyapunov Functions 1
More informationSome remarks on twoasset options pricing and stochastic dependence of asset prices
Some remarks on twoasset options pricing and stochastic dependence of asset prices G. Rapuch & T. Roncalli Groupe de Recherche Opérationnelle, Crédit Lyonnais, France July 16, 001 Abstract In this short
More informationBlackScholes Option Pricing Model
BlackScholes Option Pricing Model Nathan Coelen June 6, 22 1 Introduction Finance is one of the most rapidly changing and fastest growing areas in the corporate business world. Because of this rapid change,
More informationLogistic Regression. Jia Li. Department of Statistics The Pennsylvania State University. Logistic Regression
Logistic Regression Department of Statistics The Pennsylvania State University Email: jiali@stat.psu.edu Logistic Regression Preserve linear classification boundaries. By the Bayes rule: Ĝ(x) = arg max
More information