Invariant Option Pricing & Minimax Duality of American and Bermudan Options



Similar documents
Numeraire-invariant option pricing

LECTURE 15: AMERICAN OPTIONS

Mathematical Finance

Martingale Pricing Applied to Options, Forwards and Futures

Chapter 1: Financial Markets and Financial Derivatives

From Binomial Trees to the Black-Scholes Option Pricing Formulas

Chapter 7. BANDIT PROBLEMS.

Stephane Crepey. Financial Modeling. A Backward Stochastic Differential Equations Perspective. 4y Springer

7: The CRR Market Model

Numerical methods for American options

No-arbitrage conditions for cash-settled swaptions

A short note on American option prices

American Capped Call Options on Dividend-Paying Assets

6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation

Adaptive Online Gradient Descent

MARTINGALES AND GAMBLING Louis H. Y. Chen Department of Mathematics National University of Singapore

Lecture 13: Martingales

A Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails

On the Snell envelope approach to optimal switching and pricing Bermudan options

Valuation of the Surrender Option in Life Insurance Policies

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Barrier Options. Peter Carr

Computational Finance Options

Option Properties. Liuren Wu. Zicklin School of Business, Baruch College. Options Markets. (Hull chapter: 9)

Chapter 2: Binomial Methods and the Black-Scholes Formula

Finance 400 A. Penati - G. Pennacchi. Option Pricing

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

The Discrete Binomial Model for Option Pricing

COMPLETE MARKETS DO NOT ALLOW FREE CASH FLOW STREAMS

EC372 Bond and Derivatives Markets Topic #5: Options Markets I: fundamentals

Geometrical Characterization of RN-operators between Locally Convex Vector Spaces

Simple Arbitrage. Motivated by and partly based on a joint work with T. Sottinen and E. Valkeila. Christian Bender. Saarland University

Lecture 2: Universality

ECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE

Moreover, under the risk neutral measure, it must be the case that (5) r t = µ t.

arxiv: v1 [math.pr] 5 Dec 2011

Robust pricing and hedging of double no-touch options

Continued Fractions and the Euclidean Algorithm

An Introduction to Competitive Analysis for Online Optimization. Maurice Queyranne University of British Columbia, and IMA Visitor (Fall 2002)

Linear Programming: Chapter 11 Game Theory

Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1

ALMOST COMMON PRIORS 1. INTRODUCTION

An example of a computable

A SNOWBALL CURRENCY OPTION

Stocks paying discrete dividends: modelling and option pricing

Infinitely Repeated Games with Discounting Ù

Duality of linear conic problems

LECTURE 9: A MODEL FOR FOREIGN EXCHANGE

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

ALGORITHMIC TRADING WITH MARKOV CHAINS

Guaranteed Annuity Options

Properties of BMO functions whose reciprocals are also BMO

Finitely Additive Dynamic Programming and Stochastic Games. Bill Sudderth University of Minnesota

Lecture. S t = S t δ[s t ].

Hedging bounded claims with bounded outcomes

Chapter 11 Options. Main Issues. Introduction to Options. Use of Options. Properties of Option Prices. Valuation Models of Options.

Bond Options, Caps and the Black Model

An exact formula for default swaptions pricing in the SSRJD stochastic intensity model

Mathematical finance and linear programming (optimization)

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS

Math 55: Discrete Mathematics

2.3 Convex Constrained Optimization Problems

Math Interest Rate and Credit Risk Modeling

Optimal Investment with Derivative Securities

Option Pricing. Chapter 9 - Barrier Options - Stefan Ankirchner. University of Bonn. last update: 9th December 2013

Mathematics for Econometrics, Fourth Edition

4: SINGLE-PERIOD MARKET MODELS

1 if 1 x 0 1 if 0 x 1

The Trip Scheduling Problem

CDS Market Formulas and Models

4.6 Linear Programming duality

10.2 Series and Convergence

LOG-TYPE MODELS, HOMOGENEITY OF OPTION PRICES AND CONVEXITY. 1. Introduction

Notes on metric spaces

Session IX: Lecturer: Dr. Jose Olmo. Module: Economics of Financial Markets. MSc. Financial Economics

FIN FINANCIAL INSTRUMENTS SPRING 2008

University of Miskolc

Lecture 6 Online and streaming algorithms for clustering

Risk-Free Assets. Case Time Value of Money

Gambling Systems and Multiplication-Invariant Measures

Essays in Financial Mathematics

No: Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

1. (First passage/hitting times/gambler s ruin problem:) Suppose that X has a discrete state space and let i be a fixed state. Let

Options On Credit Default Index Swaps

Valuing Options Embedded in Life Insurance Policies

CS 522 Computational Tools and Methods in Finance Robert Jarrow Lecture 1: Equity Options

Options pricing in discrete systems

Transcription:

Invariant Option Pricing & Minimax Duality of American and Bermudan Options Farshid Jamshidian NIB Capital Bank N.V. FELAB, Applied Math Dept., Univ. of Twente April 2005, version 1.0 Invariant Option Pricing & Minimax Duality of American and Bermudan Options p.1/34

Contents I. Numeraire-invariant option pricing Options and their price processes, price transitivity, indistinguishable option, non-negative arbitrage, semipositive options, payoff process, trigger options, dominated option convergence, superclaims and Doob-Meyer decomposition. (pp. 1-13) II. Snell envelope, american options, minimax duality Snell envelope, american option definition and pricing formula in the continuous case, multiplicative minimax duality, multiplicative decomposition. (pp. 14-19) III. Bermudan options, stream rollover, minimax duality Option streams, bermudan option definition and pricing formula, rollover operator, minimax duality, domineering options, stream rollover, bermudan rollover option, regenerative tenors and streams, primal-dual bounds, rollover strategies. (pp. 20-34) p.2/34

A conceptual definition of an option An Option is a pair O = (T,O) consisting of an Expiry T and a Payoff O (in base currency) paid at T. The expiry T is a stopping time (bounded by m > 0), and the payoff O is a random variable known at time T, i.e., measurable w.r. to σ-algebra F T of events at or before T : F T := {Λ F : Λ {T t} F t }. For a European option, the expiry T is deterministic. American and Bermudan options: T is the optimal exercise time. Barrier options: T is the first passage time to the barrier. Credit derivatives with recovery : T is the default time. p.3/34

A conceptual definition of an option The definition so far depends only on the filtration (F t ) m t=0. To talk about the option price, a probability measure P and an integrability condition are required. Think of a Numeraire β as a claim which pays no dividend and has a positive price β t > 0 at all times t m, e.g., a zero-dividend stock, or the m-maturity zero-coupon bond. To each numeraire β, there is associated a Numeraire Measure P β, characterized by the property that if B is any other numeraire, then the relative price process (B t /β t ) is a (right-continuous) P β -martingale. The required integrability condition on option O = (T,O) is this: O/β T is P β -integrable for some numeraire β. p.4/34

Numeraire invariance of the option definition The important aspect of this integrability condition is that if it holds for some numeraire, then it holds for all numeraires: B 0 β 0 E B [ O B T ] = E β [ O B T B m β m ] (change of numeraire) = E β [E β [ O B T B m β m F T ]] (iterating expectation) = E β [ O B T E β [ B m β m F T ]] (by F T measurability of O B T ) = E β [ O B T B T β T ] (optional sampling theorem) = E β [O/β T ] <. p.5/34

Price process O t of an option Consider investing the option payoff O at expiry T in a numeraire β and holding this position until the terminal date m. We end up with a claim that pays β m O/β T at time m. At a time and state before expiry (i.e., t < T(ω)), the option has not yet been invested in the numeraire, so this claim is identical with the option itself. We are thus forced to define the option price O t to be the price of this claim, i.e., β t E β [O/β T F t ]. After expiry, the option has ceased to exist and has no price. In this case it is convenient to define the option price to be zero. We thus arrive at the following definition of an option price: O t := 1 t T β t E β [ O β T F t ]. This definition is independent of choice of numeraire β. p.6/34

Price Transitivity Law Using the optional sampling theorem, the option price at any stopping time τ (bounded by m) is given by O τ = 1 τ T β τ E β [ O β T F τ ] a.s. The pair (τ, O τ ) is a τ-expiry option with payoff O τ. Let S be another stopping time. What can we say about the time S price (τ, O τ ) S of this option? When S τ T, we simply have (τ, O τ ) S = O S. That is, pricing to time τ and then pricing to time S is the same as pricing directly to time S. p.7/34

Indistinguishable options Two options O and O Indistinguishable if the price processes (O t ) and (O t) are indistinguishable, i.e., a.s. O t = O t all t. Theorem: Options O = (T,O) and O = (T,O) are indistinguishable if and only if O = O a.s. and {T T } {O = 0} a.s. So, T and T need not be the same, but they can differ only at zero payments. Notation: We write O O if a.s. O t O t all t. p.8/34

Nonnegative options and nonnegative arbitrage An option O = (T, O) is Nonnegative if O 0 a.s. It is Positive if O > 0 a.s. (In practice, most options are nonnegative, but are not positive either, for they can have zero payoff in some states (i.e., P[O = 0] > 0), e.g., call and put options and swaptions.) Nonnegative Arbitrage. Once the price of a nonnegative option becomes zero, it stays zero thereafter, i.e., for almost all paths ω, if O t (ω) = 0, then O s (ω) = 0 for all s t. if O(ω) > 0, then O t (ω) > 0 for all t T(ω). p.9/34

Semipositive options A nonnegative option O is Semipositive if its price is positive before expiry T, i.e., at each time t, O t > 0 a.s. on {t < T }. This then implies a.s. O t > 0 on {t < T } all t, i.e., for almost all paths ω, O t (ω) > 0 at all times t < T(ω). A nonnegative option is indistinguishable from a semipositive option : Let O = (T,O) be a nonnegative option. Then, there exists a unique semipositive option that is indistinguishable from O, namely the option (T 0,O), where T 0 := inf{t > 0 : O t = 0}. (It turns out that O is automatically F T 0-measurable - in fact, O = O T 0 a.s.) p.10/34

Payoff processes and trigger options A progressively measurable process Z = (Z t ) is a Payoff Process if a.s. Z t β t all t for some numeraire β. Example: Z t = (β t K) +, K > 0. Proposition: Let Z be a payoff process. Then for any numeraire β, the β-deflated process (Z t /β t ) is of P β -class D. In particular, for any stopping time T, the pair (T,Z T ) is an option. We call the T -expiry option (T,Z T ) as a Z-Trigger Option. Examples of trigger options: American and Bermudan options, barrier options, credit derivatives with recovery process. p.11/34

Dominated and trigger option convergence Dominated option convergence: Let (O n ) n=1, O n = (T n,o n ) by a sequence of options such that T n ց T a.s., O n O a.s. to some random variales T and O. Assume there exists a numeraire β such that Ot n β t a.s. for all t and n. Then, O = (T,O) is an option, and a.s. Ot n O t, all t. When the dominating numeraire β can be chosen continuous, then the condition T n ց T can be weakened to T n T. Trigger option convergence: Let (Z t ) be a right continuous payoff process and T n ց T. The theorem implies that a.s. (T n,z Tn ) t (T,Z T ) t, all t. p.12/34

Doob-Meyer decomposition of superclaims A Superclaim is a right-continuous payoff process (V t ) such that V t (s,v s ) t a.s. for all t s. A Supernumeraire is a positive superclaim. As we saw, the Snell envelope is a superclaim. Proposition: A right-continuous payoff process (V t ) is a superclaim if and only if the process (V t /β t ) is a right-continuous P β -supermartingale for some (hence all) numeraire β. Doob-Meyer decomposition: Let (V t ) be a supernumeraire and β be a numeraire. Then there exist a unique numeraire B with B 0 = V 0 and a decreasing predictable process (A t ) such that a.s. V t = β t A t + B t all t. p.13/34

The Snell envelope The Snell Envelope process of a right continuous payoff process Z = (Z t ) is defined by V t := sup T t (T,Z T ) t, where supremum is taken over the set all stopping times T satisfying t T m. Theorem. (V t ) is a right continuous payoff process, and (s,v s ) t = sup T s (T,Z T ) t. (t s) Corollary. (V t ) is a superclaim. Indeed, for t s, V t := sup(t,z T ) t sup(t,z T ) t = (s,v s ) t. T t T s p.14/34

The american option in the continuous case Simple examples show that the supremum sup T 0 (T, Z T ) 0 in definition of Snell envelope is not necessarily attained at any stopping time T. In continuous case we show the supremum is attained (and suspect this to be the case when jumps of Z are totally inaccessible). Set T t := inf{s [t,m] : Z s = V s }. Theorem. Let Z be a continuous payoff process that is dominated by a continuous numeraire. Then Z T t = V T t and V t = (T t,z T t ) t. Further for all times t and s, we have (Ts,Z T s ) t = 1 t Ts sup (T,Z T ) t. T max(t,s) In particular, A t = 1 t T 0 V t, all t, where A := (T 0,Z T 0 ). p.15/34

Multiplicative minimax duality Let (Z t ) be a positive right-continuous payoff process. The Snell envelope (V t ) is then a supernumeraire, and Doob-Meyer decomposition implies there are many Domineering Numeraire, i.e., numeraires B such that B 0 = V 0 and B t V t for all t. Proposition: Let B be a domineering numeraire. Then sup( Z t ) = 1. t 0 B t Multiplicative minimax duality formula: a.s., all t, V t = inf β te β [sup( Z s ) F t ]. β C + β s s t p.16/34

Multiplicative minimax duality In particular, V 0 = inf β β 0 E β [sup t 0 (Z t /β t )]. The infimum is attained at any domineering numeraire. So, β 0 E β [sup t 0 (Z t /β t )] is an upper bound for the American option price V 0, for any numeraire β. Such an upper bound can be computed by Monte-Carlo simulation. An suitable numeraire must first be chosen. These results extend to nonnegative payoff processes (Z t ). An additive version of minimax duality was previously derived by Rogers (2001) and Haugh & Kogan (2001), and further studied in Andersen & Broadie (2001), Joshi & Theis (2002), and Kolodko & Schoenmakers (2003). p.17/34

Multiplicative Doob-Meyer decomposition A Local Numeraire is an adapted, right continuous, positive process (B t ) such that (B t /β t ) is a P β -local martingale for some (hence all) numeraire β. Theorem: Let (V t ) be a supernumeraire. Then there exists a unique decomposition V t = D t B t, where (D t ) is a decreasing predictable process and (B t ) is a local numeraire with B 0 = V 0. A supernumeraire (V t ) Multiplicative, if the local numeraire (B t ) in the multiplicative decomposition V t = D t B t is actually the price process of a numeraire B. We then refer to this numeraire B as the Rollover Numeraire associated to (V t ). It is clearly a domineering numeraire, and as such relevant to minimax duality. p.18/34

An application of multiplicative decomposition Corollary: Assume that discount factors satisfy (s, 1) t 1 for all t s. Then there exists a unique increasing, predictable, local numeraire (B t ) with B 0 = 1. The assumption is equivalent to the identically one process being a supernumeraire. Applying the multiplicative Doob-Meyer decomposition, we obtain a decomposition 1 = D t B t. The resulting local numeraire (B t ) is increasing, as it equals (1/D t ). This increasing local numeraire (B t ) can be interpreted as the continuous money market account. If it is further assumed to be absolutely continuous, then, taking its logarithmic derivative, we obtain the instantaneous interest-rate process r t, which is nonnegative and satisfies B t = exp( t 0 r sds). p.19/34

Option streams A (Finite) Option Stream (or simply a Stream) is a finite sequence O = (O n ) k n=1 of options O n = (T n,o n ) with increasing expiries T 1 T k. Stream O is called: Positive if O n > 0 a.s., all n. Ditto, Nonnegative. Decreasing if O n+1 T n O n a.s., all n, or equivalently, if a.s., 1 t Tn Ot n+1 Ot n all t,n. It also equivalent to the condition that for some (hence all) numeraire β, the discrete deflated envelope process (O n /β Tn ) k n=1 is a supermartingale under the finite filtration (F Tn ) k n=1. a Trigger Stream if O n (ω) = O n+1 (ω) whenever T n (ω) = T n+1 (ω). (Equivalently, 1 Ti =T j O i = 1 Ti =T j O j, all i, j). p.20/34

Bermudan option stream Henceforth, we take as given a payoff process Z. e.g., Z t = (K S t ) +. Let τ = (τ 1,,τ k ) be a Tenor, i.e., sequence of increasing stopping times τ 1 τ k. Define the trigger stream E := (E n ) k n=1, E n := (τ n,z τn ). We view E as the underlying european option stream. (In practice, the expiries τ n are deterministic, such as annually or daily.) Define the Associated Bermudan Stream B := (B n ) k n=1 by B n := (Tn,Z T n ), where the Optimal Exercise Tenor T := (T1,,Tk ) is defined by either of the following two equivalent definitions. p.21/34

The optimal exercise tenor Backward inductive definition: Set T k := τ k. For n < k, define inductively (setting B n+1 := (T n+1, Z Tn+1 )), T n := 1 Zτ n B n+1 τn τ n + 1 Zτ n<b n+1 τn T n+1. Snell envelope definition: Define T n := min{t {τ n,,τ k } : Z τn = sup (T,Z T ) τn }. T {τ n,,τ k } The well-known equivalence is easily proved by induction. Recall, the bermudan stream is defined as B := (B n ) k n=1, B n := (T n,z T n ). p.22/34

Bermudan pricing formula and consquences Bermudan option pricing formula: B n t = 1 t T n sup (T,Z T ) t. t T {τ n,,τ k } Corollaries: Time-0 Pricing: B n 0 = sup T {τn,,τ k }(T,Z T ) 0. Snell envelope formula: B n τ n = sup T {τn,,τ k }(T,Z T ) τn. Principle of Dynamic Programming: B n τ n = max(z τn, B n+1 τ n ). Bermudan stream B is decreasing: BT n n Bn+1 Tn. p.23/34

Rolling an option over a positive option Let O = (T,O) be an option and O = (T,O ) be a positive option with T T. Define Rollover Option O O by O O := (T, OO O T We interpret O O as the option obtained by investing at time T the payoff O in option O. ). The rollover operator is associative on positive options: (O 1 O 2 ) O 3 = O 1 (O 2 O 3 ). We denote this by O 1 O 2 O 3, etc. p.24/34

Rolling an option over a nonnegative option Let O = (T,O) be an option and O = (T,O ) be a nonnegative option with T T. Define Rollover Option O O by O O := (1 O T=0 T + 1 O T>0 T, 1 O T=0 O + O O T O ). Pricing is given by (O O ) t = O t + 1 t>t O O T O t. The rollover operator is not associative in general. A few properties of are : (O O ) S = O S, S T. O O = O; O (O O ) = O O, etc. O (O + O ) O O + (O O ). lim (O ε 0 (O + εo )) t = (E O ) t. (by dominated option convergence) p.25/34

Minimax duality of nonnegative payoff processes Henceforth, we assume Z 0 (i.e., a.s. Z t 0, all t.) Let O + (resp. O ++ ) denote the set of all nonnegative (resp. positive) options (T,O) with T τ k. Multiplicative minimax duality formula: B 1 0 = inf O O ++( max n=1,,k (En O)) 0 = min O O +( max n=1,,k (En O)) 0. B 1 0 = min max O O ++( n=1,,k (En O)) 0 if Z > 0. (The part is easy.) More generally, for any 1 i k and stopping time τ τ i, B i τ = inf max O O ++( n=i,,k (En O)) τ = min max +( n=i,,k (En O)) τ. O O p.26/34

Domineering options and minimax duality A Domineering option is a nonnegative option O such that O τn Z τn and O 0 = B 1 0. A nonnegative option O is domineering if and only if O = max n=1,,k (En O). Corollary. A domineering option O satisfies B 1 0 = ( max n=1,,k (En O)) 0. So, in the minimax formula B 1 0 = min O O + (max n=1,,k (E n O)) 0, the minimum is attained at every domineering option O. Our next goal is to construct a domineering option denoted B. p.27/34

Rollover of nonnegative option stream Rollover option O of a positive stream O = (O n ) k n=1 is k 1 O := O 1 O k = (T k,o k n=1 O n O n+1 T n ), For a nonnegative option streams we define the Left and Right Associative Rollover Options respectively by O = ( ((O 1 O 2 ) O 3 ) O k 1 ) O k. O = O 1 (O 2 (O 3 (O k 1 O k ) )). Of course, for positive streams, O = O. p.28/34

Stream rollover associativity and pricing formula We call a nonnegative stream O is Associative if O = O and this holds for all substreams of O too. Proposition. Decreasing and increasing streams are associative. Semipositive trigger streams are associative. Rollover pricing formula: For a nonnegative stream, a.s. all t, O t = O 1 t + k n=2 1 Tn 1 <t n 1 i=1 O i T i O i+1 T i O n t. (A similar but more complex formula can be written for O t.) p.29/34

Some consequences of rollover pricing formula O 0 = O 0 = O 1 0. Denote O also by O k. Ditto for n k. Then O S = O n S, S T n. (Ditto OS ). For positive streams we have, O T n = O n n 1 j=1 O j O j+1 ; T j O n O = O n O k. Proposition. If O is a decreasing nonnegative stream then O k O, and O n O O for all n. p.30/34

The bermudan rollover option B Since B is decreasing, B τ n (B n B ) τn = B n τ n Z τn. As B 0 = B 1 0, it follows B is a domineering option. Hence, and B = max n=1,,k (En B ); B 1 0 = ( max n=1,,k (En B )) 0. The minimax duality formula B 1 0 = min O O + (max n=1,,k (E n O)) 0 now easily follows. The bermudan stream B (is associative and) satisfies the stream rollover strategy formula: B = (τ 1, B 1 τ 1 ) (τ k, B 1 τ k ). p.31/34

Regenerative tenors and streams A tenor T = (T n ) k n=1 is Regenerative at at tenor τ = (τ n ) k n=1 if τ k = T k, and for n < k, τ n T n and 1 τn <T n T n = 1 τn <T n T n+1. Last condition can also be written as T n = 1 τn =T n τ n + 1 τn <T n T n+1, or, if preferred, 1 τn <T n = 1 τn <T n =T n+1. Then T n {τ n,,τ k }, all n. By induction one shows 1 t>τn (T n,z n ) t = k 1 i=n+1 1 τi 1 <t τ i T n (T i,z i ) t. Define the associated Regenerative Stream Z T by Z T := (Z n T ) k n=1, Z n T := (T n,z Tn ). Example: The optimal exercise tenor T, and the bermudan stream B = Z T are regenerative. p.32/34

Primal-dual bounds for regenerative streams For any regenerative stream, we have primal-dual bounds: (T 1,Z T1 ) 0 B 1 0 ( max n=1,,k (En Z T )) 0. Various examples of regenerative streams in the literature aim at a tight (additive) primal-dual bounds (or a tight duality gap ). A regenerative stream satisfies Z T max n=1,,k (En Z T ). If Z τn (Z T ) τn for all n, this implies Z is domineering, hence T equality holds and (T 1,Z T1 ) 0 = B0 1 = (max n=1,,k (E n Z T )) 0. p.33/34

Stream rollover strategies A Stream Rollover Strategy is a pair (τ, O ), where τ is a tenor and O is a stream such that its expiry tenor is regenerative at τ, and 1 τn <T n O n = 1 τn <T n O n+1 for all n < k. Examples are (τ,z T ), where Z T is a regenerative trigger stream as above, e.g., (τ, B ) The strategy is to rollover O at the tenor τ : Theorem. Let (τ, O ) be a stream rollover strategy such that O is nonnegative and associative. Then O = (τ 1, Oτ 1 1 ) (τ k, Oτ 1 k ). p.34/34