Lecture Quantitative Finance Spring Term 2015

Similar documents
Department of Mathematics. Mathematics of Financial Derivatives

Queens College, CUNY, Department of Computer Science Computational Finance CSCI 365 / 765 Fall 2017 Instructor: Dr. Sateesh Mane.

Richardson Extrapolation Techniques for the Pricing of American-style Options

CS 3331 Numerical Methods Lecture 2: Functions of One Variable. Cherung Lee

FIN FINANCIAL INSTRUMENTS SPRING 2008

Week 2 Quantitative Analysis of Financial Markets Hypothesis Testing and Confidence Intervals

Lecture Quantitative Finance Spring Term 2015

F A S C I C U L I M A T H E M A T I C I

Chapter 7 One-Dimensional Search Methods

Stochastic Differential Equations in Finance and Monte Carlo Simulations

The Binomial Model. Chapter 3

Feb. 4 Math 2335 sec 001 Spring 2014

The Black-Scholes PDE from Scratch

Interpolation. 1 What is interpolation? 2 Why are we interested in this?

Final Projects Introduction to Numerical Analysis Professor: Paul J. Atzberger

25 Increasing and Decreasing Functions

Final Projects Introduction to Numerical Analysis atzberg/fall2006/index.html Professor: Paul J.

Extensions to the Black Scholes Model

1.1 Basic Financial Derivatives: Forward Contracts and Options

STOCHASTIC CALCULUS AND BLACK-SCHOLES MODEL

February 2 Math 2335 sec 51 Spring 2016

FINITE DIFFERENCE METHODS

Lecture 6: Option Pricing Using a One-step Binomial Tree. Thursday, September 12, 13

What can we do with numerical optimization?

Queens College, CUNY, Department of Computer Science Computational Finance CSCI 365 / 765 Spring 2018 Instructor: Dr. Sateesh Mane. September 16, 2018

University of Colorado at Boulder Leeds School of Business MBAX-6270 MBAX Introduction to Derivatives Part II Options Valuation

Options. An Undergraduate Introduction to Financial Mathematics. J. Robert Buchanan. J. Robert Buchanan Options

Han & Li Hybrid Implied Volatility Pricing DECISION SCIENCES INSTITUTE. Henry Han Fordham University

MAT25 LECTURE 10 NOTES. = a b. > 0, there exists N N such that if n N, then a n a < ɛ

Homework Assignments

Exam in TFY4275/FY8907 CLASSICAL TRANSPORT THEORY Feb 14, 2014

Asymmetric Information: Walrasian Equilibria, and Rational Expectations Equilibria

Chapter 5 Finite Difference Methods. Math6911 W07, HM Zhu

Outline. 1 Introduction. 2 Algorithms. 3 Examples. Algorithm 1 General coordinate minimization framework. 1: Choose x 0 R n and set k 0.

4. Black-Scholes Models and PDEs. Math6911 S08, HM Zhu

Lecture 17. The model is parametrized by the time period, δt, and three fixed constant parameters, v, σ and the riskless rate r.

Derivative Securities

LECTURE 2: MULTIPERIOD MODELS AND TREES

The Fixed Income Valuation Course. Sanjay K. Nawalkha Gloria M. Soto Natalia A. Beliaeva

CHAPTER 9. Solutions. Exercise The payoff diagrams will look as in the figure below.

Queens College, CUNY, Department of Computer Science Computational Finance CSCI 365 / 765 Fall 2017 Instructor: Dr. Sateesh Mane.

Yao s Minimax Principle

1 The Solow Growth Model

The Black-Scholes Model

The Black-Scholes Model

Solutions of Exercises on Black Scholes model and pricing financial derivatives MQF: ACTU. 468 S you can also use d 2 = d 1 σ T

MASM006 UNIVERSITY OF EXETER SCHOOL OF ENGINEERING, COMPUTER SCIENCE AND MATHEMATICS MATHEMATICAL SCIENCES FINANCIAL MATHEMATICS.

Lecture 17: More on Markov Decision Processes. Reinforcement learning

FE610 Stochastic Calculus for Financial Engineers. Stevens Institute of Technology

ECON FINANCIAL ECONOMICS

DRAFT. 1 exercise in state (S, t), π(s, t) = 0 do not exercise in state (S, t) Review of the Risk Neutral Stock Dynamics

Part 3: Trust-region methods for unconstrained optimization. Nick Gould (RAL)

TDT4171 Artificial Intelligence Methods

The Black-Scholes Model

Chapter 5 Integration

Homework Assignments

Computational Finance Finite Difference Methods

Probability. An intro for calculus students P= Figure 1: A normal integral

Stochastic Modelling in Finance

lecture 31: The Secant Method: Prototypical Quasi-Newton Method

INTEREST RATES AND FX MODELS

SYSM 6304: Risk and Decision Analysis Lecture 6: Pricing and Hedging Financial Derivatives

CONSTRUCTING NO-ARBITRAGE VOLATILITY CURVES IN LIQUID AND ILLIQUID COMMODITY MARKETS

ECON 214 Elements of Statistics for Economists 2016/2017

Introduction to Probability Theory and Stochastic Processes for Finance Lecture Notes

1 Overview. 2 The Gradient Descent Algorithm. AM 221: Advanced Optimization Spring 2016

1. What is Implied Volatility?

Module 10:Application of stochastic processes in areas like finance Lecture 36:Black-Scholes Model. Stochastic Differential Equation.

MATH 476/567 ACTUARIAL RISK THEORY FALL 2016 PROFESSOR WANG. Homework 3 Solution

The Binomial Lattice Model for Stocks: Introduction to Option Pricing

King s College London

Volatility Smiles and Yield Frowns

Put-Call Parity. Put-Call Parity. P = S + V p V c. P = S + max{e S, 0} max{s E, 0} P = S + E S = E P = S S + E = E P = E. S + V p V c = (1/(1+r) t )E

A distributed Laplace transform algorithm for European options

NEWCASTLE UNIVERSITY SCHOOL OF MATHEMATICS, STATISTICS & PHYSICS SEMESTER 1 SPECIMEN 2 MAS3904. Stochastic Financial Modelling. Time allowed: 2 hours

Markov Decision Processes II

The Greek Letters Based on Options, Futures, and Other Derivatives, 8th Edition, Copyright John C. Hull 2012

Statistics 13 Elementary Statistics

Handout 4: Deterministic Systems and the Shortest Path Problem

Lecture 22. Survey Sampling: an Overview

P VaR0.01 (X) > 2 VaR 0.01 (X). (10 p) Problem 4

Systems of Ordinary Differential Equations. Lectures INF2320 p. 1/48

LECTURE 4: BID AND ASK HEDGING

Calibration Lecture 1: Background and Parametric Models

Math 181 Lecture 15 Hedging and the Greeks (Chap. 14, Hull)

Volatility of Asset Returns

Financial Markets & Risk

IEOR E4602: Quantitative Risk Management

Black-Scholes Option Pricing

Advanced Topics in Derivative Pricing Models. Topic 4 - Variance products and volatility derivatives

CS227-Scientific Computing. Lecture 6: Nonlinear Equations

Fixed-Income Options

MATH3075/3975 FINANCIAL MATHEMATICS TUTORIAL PROBLEMS

Mathematics of Finance Final Preparation December 19. To be thoroughly prepared for the final exam, you should

Chapter 17. Options and Corporate Finance. Key Concepts and Skills

A Non-Parametric Technique of Option Pricing

Some Computational Aspects of Martingale Processes in ruling the Arbitrage from Binomial asset Pricing Model

On the use of time step prediction

No-arbitrage theorem for multi-factor uncertain stock model with floating interest rate

Chapter 9 - Mechanics of Options Markets

Transcription:

implied Lecture Quantitative Finance Spring Term 2015 : May 7, 2015 1 / 28

implied 1 implied 2 / 28

Motivation and setup implied the goal of this chapter is to treat the implied which requires an algorithm for the general problem is given a function F : R R, find an x R such that F (x ) = 0 in general, of course, we cannot find an x analytically, and must therefore content ourselves with an approximation via a computational method it is worth keeping in mind that, depending on the nature of F, there may be no suitable x, exactly one x or many x values we introduce two algorithms for the bisection method Newton s method (also called Newton-Raphson method) 3 / 28

The bisection method implied is based on the observation that if a continuous function changes sign, then it must pass through zero, that is for continuous functions F, if x a < x b with F (x a )F (x b ) < 0 then there exists some x with x a < x < x b with F (x ) = 0 having found x a and x b with F (x a)f (x b ) < 0 we could evaluate F at the mid-point x mid := (x a + x b )/2 the sign of F (x mid ) must match either the sign of F (x a) or F (x b ); this means that one of the intervals [x a, x mid ] or [x mid, x b ] must contain an x by repeating this process we can construct an arbitrarily small interval in which an x must lie, hence we can find an x to any level of accuracy 4 / 28

implied The bisection method: algorithm Step 1: find x a and x b with x a < x b such that F (x a)f (x b ) 0 Step 2: set x mid := (x a + x b )/2 and evaluate F (x mid ) Step 3: if F (x a)f (x mid ) < 0 then reset x b = x mid. Otherwise reset x a = x mid Step 4: if x b x a < ε then stop. Use (x a + x b )/2 as the approximation to x. Otherwise return to Step 2. note that we must choose a value ε > 0 for our stopping criterion x b x a < ε it is easy to see that the value (x a + x b )/2 on termination is no more than a distance ε/2 from a solution x (hence ε controls the accuracy of the process) because the bisection method halves the length of the interval [x a, x b ] on each iteration, we may bound the error at the kth iteration by L/2 k+1 where L is the length of the original interval, x b x a this is referred to as a linear convergence bound because the error decreases by a linear factor (in this case 1/2) on each iteration 5 / 28

implied Newton s method is faster than the bisection method can be derived in a number of ways: here we will use a Taylor series approach suppose we wish to compute a sequence x 0, x 1, x 2,... that converges to a solution x we may expand F (x + δ) for small δ by F (x n + δ) = F (x n) + δf (x n) + O(δ 2 ) ignoring O(δ 2 ) and setting F (x n) + δf (x n) = 0 gives δ = F (x n)/f (x n) it follows that if x n is close to a solution x then x n+1 = x n F (xn) F (x n) should be even closer given a starting value, x 0, the last iteration defines Newton s method 6 / 28

Newton s method implied since we discarded an O(δ 2 ) term in Taylor s approximation we may expect that the error x n x squares as n increases to n + 1: that is if x n x = O(δ) then x n+1 x = O(δ 2 ) to see this more clearly, note that using F (x ) = 0 and assuming F (x n) 0 a Taylor series gives x n+1 x = ( F (xn) x n x F (x ) ) F (x n) = x n x (xn x )F (x n) + O((x n x ) 2 ) F (x n) = O((x n x ) 2 ) this type of analysis can be formalised in a theorem 7 / 28

implied Suppose F has a continuous second derivative x R satisfies F (x ) = 0 and F (x ) 0 Newton s method: Theorem Then there exists a δ > 0 such that for x 0 x < δ the sequence given by x n+1 = x n F (xn) F (x n) is well-defined for all n > 0, with lim n xn x = 0, and there exists a constant C > 0 such that x n+1 x C x n x 2. 8 / 28

Newton s method: comments implied the last inequality shows that Newton s method has a quadratic (or second order) convergence this result requires the starting value x 0 to be chosen sufficiently close to x ; in practice Newton s method works very well when a suitable x 0 is found, but may fail to converge otherwise 9 / 28

Newton s method: computational example implied suppose we wish to find the value of x such that P(X x ) = 2 3 where X N(0, 1) essentially we want to solve F (x) = 0, where F (x) := N(x) 2 3 with N(x) = 1 x e s2 2 ds 2π it follows from the definition of N that F is an increasing function and F (0) = 1 2 2 3 < 0 and lim F (x) = 1 2 x 3 > 0 hence we may immediately conclude that the F (x) = 0 has a unique solution 0 < x < 10 / 28

Newton s method: computational example (cont d) implied we may apply the bisection method with x a = 0 and with x b sufficiently large such that F (x b ) > 0 for the choice x b = 10 and a tolerance of ε = 10 5 in the stopping criterion the bisection method needs 20 iterations setting x 0 = 1 and stopping with Newton s method when x n+1 x n < 10 5 only four iterations are needed to produce an error of around 10 12 and the error roughly squares from one step to the next repeating Newton s method with x 0 = 2 however, results in a sequence that blows-up 11 / 28

Motivation implied the Black-Scholes call and put values depend on S, K, r, T t and σ 2 of these five quantities, only the asset cannot be observed directly; how do we find a suitable value for σ? approach: extract the from the observed market data - given a quoted option value, and knowing S, t, K, r and T find the σ that leads to this value having found σ, we may use Black-Scholes formula to value other options on the same asset a σ computed this way is known as an implied ; the name indicated that σ is implied by option value data in the market this is a totally different way to get σ compared with the historical 12 / 28

Option value as a function of implied we focus here on the case of extracting σ from a European call option quote an analogous treatment can be given for a put, or alternatively, the put quote could be converted into a call quote via put-call parity we assume that the parameters K, r and T and the asset price S and time t are known in practice we will typically be interested in the time-zero case, t = 0 and S = S 0 we thus treat the option value as function of σ only, and, from now on, denote it by C(σ) given a quoted value C, our task is to find the implied σ that solves C(σ ) = C it is possible to exploit the special form of the arising in this context 13 / 28

implied Option value as a function of : σ since is non-negative, only values σ [0, ) are of interest let us look at C(σ) in the case of large or small first assume σ recall d 1 = log(s/k) + (r + 1 2 σ2 )(T t) σ T t so that d 1 and hence N(d 1 ) 1 similarly d 2 = d 1 σ T t so that d 2 and hence N(d 2 ) 0 using Black-Scholes formula C(σ) = S N(d 1 ) K e r(t t) N(d 2 ) it follows that lim σ C(σ) = S 14 / 28

implied Option value as a function of : next we look at σ 0 + and distinguish three cases σ 0 + 1 S Ke r(t t) > 0; in this case log(s/k) + r(t t) > 0 so that if σ 0 + we have d 1, N(d 1 ) 1, d 2 and N(d 2 ) 1. Hence, C S Ke r(t t). 2 S Ke r(t t) < 0; in this case log(s/k) + r(t t) < 0 so that if σ 0 + we have d 1, N(d 1 ) 0, d 2 and N(d 2 ) 0. Hence, C 0. 3 S Ke r(t t) = 0; in this case log(s/k) + r(t t) = 0 so that if σ 0 + we have d 1 0, N(d 1 ) 1/2, d 2 0 and N(d 2 ) 1/2. Hence, C 1 2 (S Ke r(t t) ) = 0. these three cases are summarized neatly by the formula lim C(σ) = max(s Ke r(t t), 0) σ 0 + 15 / 28

implied Bounds for the option value as a function of now we recall from previous lectures that the derivative of C with respect to σ, that is the vega, is given by vega = S T t N (d 1 ) and in particular we know that C/ σ > 0 since C = C(σ) is continuous with a positive first derivative, we conclude that C is monotonically increasing on [0, ) from lim σ 0 + C(σ) = max(s Ke r(t t), 0) and from lim C(σ) = S σ the values of C(σ) must lie between max(s Ke r(t t), 0) and S consequently the C(σ) = C has a solution if, and only if, max(s Ke r(t t), 0) C S 16 / 28

implied The second derivative of C(σ) for later use we will calculate the second derivative differentiating vega := C σ S T t N (d 1 ) we get using we have 2 C σ 2 = S T t e 1 d 2 d2 1 1 d 1 2π σ d 1 = log(s/k) + (r + 1 2 σ2 )(T t) σ T t d 1 σ log(s/k) + r(t t) = σ 2 + 1 T t T t 2 = log(s/k) + (r σ2 /2)(T t) σ 2 T t = d 2 σ 17 / 28

implied consequently The second derivative of C(σ) (cont d) 2 C σ 2 = S T t e 2 1 d2 1 d1d 2 2π σ = d 1d 2 C σ σ from the last it follows that C/ σ has its maximum over [0, ) at σ = σ given by σ := 2 log(s/k) + r(t t) T t Exercise Prove that C/ σ has a unique maximum over [0, ) at σ = σ defined above. moreover 2 C σ 2 = T t 4σ 3 ( σ4 σ 4 ) C σ 18 / 28

Bisection for computing the implied implied we will write our for σ in the form F (σ) = 0 where F (σ) = C(σ) C to apply the bisection method, we require an interval [σ a, σ b ] over which F (σ) changes its sign it follows from lim σ C(σ) = S and from lim σ 0 + C(σ) = max(s Ke r(t t), 0) and the monotonicity of C(σ) that this can be done by fixing K (say K = 0.05) and trying [0, K], [K, 2K], [2K, 3K],... 19 / 28

implied Newton s method for computing the implied Newton s method takes the form σ n+1 = σ n F (σn) F (σ n) where F (σ) = C is given above σ using F (σ ) = 0 and the mean value theorem, we have σ n+1 σ = σ n σ F (σn) F (σ ) F (σ n) = σ n σ (σn σ )F (ξ n) F (σ n) for some ξ n between σ n and σ hence σ n+1 σ σ n σ = 1 F (ξ n) F (σ n) 20 / 28

Newton s method for computing the implied implied we know that F (σ) is positive and takes its maximum at the point σ from above hence, using the starting value σ 0 = σ we must have 0 < F (ξ 0 ) < F (σ) so that the last equality implies 0 < σ 1 σ σ 0 σ < 1 this means that the error in σ 1 is smaller than, but has the same sign as, the error in σ 0 we will distinguish if σ < σ or if σ > σ 21 / 28

implied Newton s method for computing the implied to proceed assume first that σ < σ then from the last inequalities we have σ 0 < σ 1 < σ we know F (σ) < 0 for all σ > σ and ξ 1 lies between σ 1 and σ hence 0 < F (ξ 1 ) < F (σ 1 ) and 0 < σ 2 σ σ 1 σ < 1 repeating this argument we get 0 < σ n+1 σ σ n σ < 1 for all n 0 so the error decreases monotonically as n increases in a similar manner one can treat the case σ > σ 22 / 28

Newton s method for computing the implied implied overall we conclude that with the choice σ 0 = σ the error will always decrease monotonically as n increases it follows that the error must tend to zero and the previous theory shows that the convergence must be quadratic therefore using σ 0 = σ: this is our method for computing the implied 23 / 28

implied with real data we now look at the implied for call options traded at the London International Financial Futures and Options Exchange (LIFFE) as reported in the Financial Times on Wednesday, 22 August 2001 the data is for the FTSE 100 index, which is an average of 100 equity shares quoted on the London Stock Exchange Exercise price Option price 5125 475 5225 405 5325 340 5425 280.5 5525 226 5625 179.5 5725 139 5825 105 24 / 28

with real data implied the expiry date for these options was December 2001 the initial price (on 22 August 2001) was 5420.3 we take values of r = 0.05 for the interest rate and T = 4/12 for the duration of the option the implied computed for the eight different exercise prices is decreasing (from approx. 0.19 to 0.174) of course, if Black-Scholes formula would be valid, the would be the same for each exercise price however in this example the implied varies by around 10% 25 / 28

with real data implied note: implied is higher for options that start out-of-the-money than for options that starting in-the-money this behaviour is typical for data arising after the stock market crash of October 1987 pre-crash plots of implied against exercise price would often produce a convex smile shape; more recent data tends to produce more of a frown 26 / 28

implied : some final comments the widely reported phenomenon that the implied is not constant as other parameters are varied does, of course, imply that the Black-Scholes formulas fail to describe the option values that arise in the marketplace this should be no surprise, given that the theory is based on a number of simplifying assumptions despite the disparities, the Black-Scholes theory, and the insights that it provides, continue to be regarded highly by both academics and market traders it is common for option values to be quoted in terms of vol; rather than giving C, the σ such that C(σ ) = C in the Black-Scholes formula is used to describe the value many attempts have been made to fix the nonconstant discrepancy in the Black-Scholes theory; a few of these have met with some success but none lead to the simple formulas and clean interpretation of the original work: see Chapter 17 of Hull (2000) 27 / 28

Answer to the Exercise implied Exercise Hint: Discuss the monotonicity of C/ σ analysing the sign of 2 C σ 2 28 / 28