Monte-Carlo Methods in Financial Engineering
|
|
- Brian Charles
- 5 years ago
- Views:
Transcription
1 Monte-Carlo Methods in Financial Engineering Universität zu Köln May 12, 2017
2 Outline Table of Contents 1 Introduction 2 Repetition Definitions Least-Squares Method 3 Derivation Mathematical Derivation Example Graphical Derivation 4 Regression-Based Pricing Algorithm Longstaff and Schwartz Tsitsiklis and Van Roy Comparison 5 Performance 6 Summary
3 Introduction Introduction The pricing of an American option is a mathematical challenge in finance for several years. American options can be exercised at any time up to their expiration dates. We want to approximate American Options by considering Bermudan Options. European Bermudan American
4 Introduction Introduction Pricing Problem Random Tree Regression Based Method Duality Random tree method: Very simple to implement. Provides a confidence interval containing the true option value. Suitable only for options with few exercise opportunities (not more than about five). The regression-based method is a very powerful technique for solving high-dimensional problems with many exercise opportunities.
5 Repetition Definitions Definitions Bermudan Option
6 Repetition Definitions Definitions Bermudan Option Option that can be exercised only at a fixed set of exercise opportunities t 1 < t 2 < < t m.
7 Repetition Definitions Definitions Bermudan Option Option that can be exercised only at a fixed set of exercise opportunities t 1 < t 2 < < t m. Option Value := V i
8 Repetition Definitions Definitions Bermudan Option Option that can be exercised only at a fixed set of exercise opportunities t 1 < t 2 < < t m. Option Value := V i The value achieved by exercising optimally.
9 Repetition Definitions Definitions Bermudan Option Option that can be exercised only at a fixed set of exercise opportunities t 1 < t 2 < < t m. Option Value := V i The value achieved by exercising optimally. Continuation Value := C i
10 Repetition Definitions Definitions Bermudan Option Option that can be exercised only at a fixed set of exercise opportunities t 1 < t 2 < < t m. Option Value := V i The value achieved by exercising optimally. Continuation Value := C i The continuation value of a Bermudan option is the value of holding rather than exercising the option.
11 Repetition Definitions Definitions Bermudan Option Option that can be exercised only at a fixed set of exercise opportunities t 1 < t 2 < < t m. Option Value := V i The value achieved by exercising optimally. Continuation Value := C i The continuation value of a Bermudan option is the value of holding rather than exercising the option. Optimal Stopping Rule
12 Repetition Definitions Definitions Bermudan Option Option that can be exercised only at a fixed set of exercise opportunities t 1 < t 2 < < t m. Option Value := V i The value achieved by exercising optimally. Continuation Value := C i The continuation value of a Bermudan option is the value of holding rather than exercising the option. Optimal Stopping Rule ˆτ = min{i : h i (X i ) Ĉi(X i )}
13 Repetition Least-Squares Method Least-Squares Method Standard approach in regression analysis that finds the line of best fit for a dataset. First, choose a well fitting model function (we will only use polynomial functions as model functions). The best fit is a function with minimal deviation to the data points. While using the least-square method, minimize the sum of squared residuals to find the best coefficients in your model function. Residual: The difference between the observed value and the fitted value, provided by the model.
14 Repetition Least-Squares Method Least-Squares Method Assume that our data can be well fitted by a polynomial function. We choose ψ s, r(x),r = 1..., M basis functions and s = 1,..., N. The given data set is approximated by a linear system of equations that looks like: ψ 1,1... ψ 1,M β } ψ N,1... ψ N,M {{ } β N A = y 1. y N }{{} Y β i are unknown coefficients that we want to estimate by least-squares.
15 Repetition Least-Squares Method Least-Squares Method We are looking for some β i so that the difference between the observed value and the fitted value, provided by the model, is as small as possible. So we want to find a β for the minimzation problem below: min β Y A β 2 2 How can you solve the linear system of equations? Normal equations A T Aβ = A T Y QR decomposition A = QR
16 Longstaff and Schwartz Algorithm - Overview The algorithm for valuing American options was developed by Francis A. Longstaff and Eduardo S. Schwartz in Hereafter, LSM will be the shortcut for Longstaff and Schwartz Algorithm. The algorithm can be divided into four sections: Simulation of paths Labeling the nodes at the expiration date Carrying out a regression analysis Valuing the option
17 Mathematical Derivation Longstaff and Schwartz Algorithm The intuition behind the approach is that the holder of an American option compares the payoff from exercising immediately with the expected payoff from continuation at any exercising date. 2 Mathematical Framework 12 Step 1: Simulate b independent paths. V0 V1 1 V2 1 V3 1 V4 1 V5 5 V5 6 V5 4 V5 3 V5 2 V5 1 Step 2: t0 =0 t1 t2 t3 t4 t5 = T Figure 2.4: Pricing procedure based on the DPP of the value process. the normal equations. Theoretically, a model function such as (2.15) justified by At the final expiration date of the option, following further the assumption: investor exercises the option if it is in-the-money or allows it to expire if it is out of-the-money. space. (A5) The payoff Zl at date tl, l =0,...,L, is a square-integrable random variable. So, E[(Zl) 2 ] < for all Zl, l =0,...,L, and Zl L2(Ω, ). PSl denotes the image Fl,PSl probability measure induced by Sl on the state space E R D, and L2 is a Hilbert Then, an important implication from this assumption is the following expression for the continuation value (2.6): Cl (A5) = m=1 xmφ m(sl), (2.17) where {φ m( )} m=1 is an orthonormal basis, and xm = Cl, φ m(sl) =E[Clφ m(sl)] are the
18 Mathematical Derivation Longstaff and Schwartz Algorithm Step 3a: We use the regression technique to approximate the conditional expectation function at each exercising date: C i (x) = E[V i+1 (X i+1 ) X i = x] We assume that the continuation values C i can be approximated by a linear combination of known functions of the current state: C i (x) = E[V i+1 (X i+1 ) X i = x] = M r=1 β ir ψ r Then, we choose M basis functions and apply the least-squares method to estimate the coefficients in our regression function. We only use in-the-money paths in the estimation since the exercise decision is only relevant if the option is in-the-money.
19 Derivation Mathematical Derivation K Longstaff and Schwartz Algorithm Step 3b: Now, we can determine whether an early exercise or holding the option is optimal at the current time point. Repeating this procedure for each in-the-money path generates an optimal stopping rule: ˆV ij = { hi (X ij ) h i (X ij ) Ĉi(X ij ) ˆV i+1j h i (X ij ) < Ĉi(X ij ) Afterwards, we go2 Mathematical backframework one point in time and 14repeat step 3. Realizations of the continuation value Approximation of the continuation value Payoff Option Value Asset Value Figure 2.5: Approximation of the continuation value via least squares at a fixed time date.
20 Mathematical Derivation Longstaff and Schwartz Algorithm Step 4: Starting at time zero, we move forward along each path until the first stopping time occurs: Then, we discount the resulting cash flows from the different exercising dates: Finally, we take the average of all paths and obtain the value of the American option: ˆV 0 = ˆV ˆV 1b b
21 Example Example Bermudan put option on a share of non-dividend-paying stock Strike price: K= 1.10 Exercise dates: t = 1, t = 2, t = 3 Riskless rate: 6% 8 sample paths for the price of the stock Payoff-function: h m = (K S(t)) + All values are in Euro Objective Find the stopping rule that maximizes the value of the option at each point along each path.
22 Example Step 1: Simulate 8 Independent Paths The table below shows the simulated data for our example. Table: Values of 8 different paths Path t=0 t=1 t=2 t= S(t) y t t
23 Example Step 2: Terminal Nodes At terminal nodes we set ˆV 3j = h 3 (X 3j ), j = 1,..., 8 as option value. Our payoff-function is given by h m = (K S(t)) +, m = 1, 2, 3. Path t=1 t=2 t=3 ˆτ = = = = = = = =
24 Example Step 3a: Regression (1) We have to find a function that approximates the continuation value at time 2. To do this, we use the regression approach. We only consider paths that are in-the-money. Table: Values of 8 different paths Path t=0 t=1 t=2 t=
25 Example Step 3a: Regression (1) We have to find a function that approximates the continuation value at time 2. To do this, we use the regression approach. We only consider paths that are in-the-money. Table: Values of 8 different paths Path t=0 t=1 t=2 t=
26 Example Step 3a: Regression (1) We are looking for an expression like Y i = β 0 + β 1 X i + β 2 X 2 i Y := discounted cash flow at t = 3 X := stock price at t = 2 i := path } {{ } Values of path itm β 0 β 1 β 2 = }{{} discounted payoffs of t = 3 Y i = X X 2
27 Example Step 3b: Exercise decision (1) Now, we try to figure out whether to exercise or to further hold the option, by comparing the exercise value and the continuation value. Table: Early exercise decision at t=2 Path Exercise Continuation We obtain the exercise value by the payoff function h m = (K S(t)) + and the continuation value by inserting X 2b in the model function that we estimated by regression.
28 Example Step 3b: Exercise decision (1) Table: Early exercise decision at t = 2 Path Exercise Continuation We obtain a vector, which reflects the stopping rule for t = 2. ˆτ 2 =
29 Example Step 3a: Regression (2) Determining the paths, which are in the money at time t = 1. Table: Values of 8 different paths Path t=0 t=1 t=2 t=
30 Example Step 3a: Regression (2) We are looking for an expression like Y i = β 0 + β 1 X i + β 2 X 2 i Y := discounted cash flow at t = 2 X := stock price at t = 1 i := path } {{ } Values of paths itm β 0 β 1 β 2 = }{{} Discounted payoffs of t = 2 Y i = X X 2
31 Example Step 3b: Exercise decision (2) Again, we try to figure out whether to exercise or to further hold the option by comparing the exercise value and the continuation value. Table: Early exercise decision at t = 1 Path Exercise Continuation We obtain the exercise value by the payoff function h m = (K S(t)) + and the continuation value by inserting X 1b in the model function that we estimated by regression.
32 Example Step 3b: Exercise decision (2) Table: Early exercise decision at t = 1 Path Exercise Continuation We obtain a vector, which reflects the stopping rule for t = 1. ˆτ 1 =
33 Example Step 4: Pricing Having identified the cash flows generated by the Bermudan put at each point along each path, the option can now be valued... Table: Stopping rule Path t=1 t=2 t= Table: Option cash flow matrix Path t=1 t=2 t=
34 Example Step 4: Pricing... by discounting each cash flow in the option cash flow matrix back to time zero and calculating the average of all paths. A mathematical frame for the discounted option value is given by: ˆV 0 = ˆV ˆV 1b b Value of the Bermudan option ˆV 0 = 0.07 e e e e e =
35 Example Eurpean Put Vs. Bermudan Put Value of the Bermudan option ˆV 0 = 0.07 e e e e e =
36 Example Eurpean Put Vs. Bermudan Put Value of the Bermudan option ˆV 0 = 0.07 e e e e e = Value of the European option ˆV 0 = 0.07 e e e e =
37 Example Eurpean Put Vs. Bermudan Put Value of the Bermudan option ˆV 0 = 0.07 e e e e e = Value of the European option ˆV 0 = 0.07 e e e e = The value of the Bermudan put is roughly twice the value of the European put.
38 Graphical Derivation Graphical Derivation 2 Mathematical Framework 12 V0 V5 5 V5 6 V5 4 V5 3 V5 2 V1 1 V2 1 V3 1 V4 1 V5 1 t0 =0 t1 t2 t3 t4 t5 = T Figure 2.4: Pricing procedure based on the DPP of the value process. the normal equations. Theoretically, a model function such as (2.15) is justified by the following further assumption: (A5) The payoff Zl at date tl, l =0,...,L, is a square-integrable random variable. So, E[(Zl) 2 ] < for all Zl, l =0,...,L, and Zl L2(Ω, ). PSl denotes the image Fl,PSl
39 Graphical Derivation Graphical Derivation Functionality of the algorithm: Six paths Four exercise dates including t 0 Payoff Functions Stopping Rule Paths OFM Backwards Induction
40 Graphical Derivation Pricing Algorithm by Longstaff and Schwartz (1) Simulate b independent paths {X 1j, X 2j,..., X mj }, j = 1,..., b (2) At terminal nodes, set V mj = h m (X mj ), j = 1,..., b (3) Apply backward induction: for i = m 1,..., 1 given the estimated values V i+1j, j = 1,..., b use regression to calculate ˆβ i set { h i (X i,j ) h i (X i,j ) V ij = Ĉi(X i,j ) V i+1j h i (X i,j ) < Ĉi(X i,j ) with Ĉi(X ij ) = β T i ψ(x) (4) Set V 0 = ˆV ˆV 1b b
41 Graphical Derivation Pricing Algorithm by Tsitsiklis and Van Roy (1) Simulate b independent paths {X 1j, X 2j,..., X m,j }, j = 1,..., b (2) At terminal nodes, set V m,j = h m (X m,j ), j = 1,..., b (3) Apply backward induction: for i = m 1,..., 1 given the estimated values V i+1j, j = 1,..., b use regression to calculate β i set ˆV i,j = max{h i (X i,j ), Ĉi(X i,j )} with Ĉi(X i,j ) = β T i (4) Set V 0 = V V1b b ψ(x)
42 Comparison Difference between Longstaff/Schwartz and Tsitsiklis/Van Roy The calculation of V ij
43 Comparison Difference between Longstaff/Schwartz and Tsitsiklis/Van Roy The calculation of V ij Tsitsiklis and Van Roy: Vi,j = max{h i (X i,j ), Ĉi(X i,j )} { h i (X i,j ) h i (X i,j ) Longstaff and Schwartz: Vij = Ĉi(X i,j ) V i+1,j h i (X i,j ) < Ĉi(X i,j )
44 Comparison Difference between Longstaff/Schwartz and Tsitsiklis/Van Roy The calculation of V ij Tsitsiklis and Van Roy: Vi,j = max{h i (X i,j ), Ĉi(X i,j )} { h i (X i,j ) h i (X i,j ) Longstaff and Schwartz: Vij = Ĉi(X i,j ) V i+1,j h i (X i,j ) < Ĉi(X i,j ) Only in-the-money paths
45 Comparison Difference between Longstaff/Schwartz and Tsitsiklis/Van Roy The calculation of V ij Tsitsiklis and Van Roy: Vi,j = max{h i (X i,j ), Ĉi(X i,j )} { h i (X i,j ) h i (X i,j ) Longstaff and Schwartz: Vij = Ĉi(X i,j ) V i+1,j h i (X i,j ) < Ĉi(X i,j ) Only in-the-money paths To get a better approximation of the continuation value, Longstaff and Schwartz suggest to consider only paths that are in-the-money.
46 Performance Measuring the Performance of a Monte-Carlo Estimator The estimator ˆV for a quantity V can be measured by the root-mean-square-error (RMSE). RMSE(V ) := E[( ˆV V ) 2 ] = Bias( ˆV ) 2 + Variance( ˆV ) We see the joint influnece of the number of basis functions and the number of paths. The more basis functions/paths chosen, the lower the RMSE.
47 Summary Overview We have introduced a method for valuing options with early exercise features. The main idea is to estimate the continuation value. Then, we can compare the continuation value to the corresponding exercise value. This procedure gives us a stopping rule. Due to the corresponding cash flows, we can finally value the option. The average of the discounted payoffs of each path is the price of the option. For a better performance you have to increase the number of paths and the number of basis functions.
48 Reference References P. Glasserman, Monte Carlo Methods in Financial Engineering, Springer, New York, USA, F. Longstaff and E. Schwartz, Valuing American options by simulation: a simple least-squares approach, Review of Financial Studies, 14 (2001), pp C. Jonen, An efficient implementation of a Least Squares Monte Carlo method for valu- ing American-style options, International Journal of Computer Mathematics, 86 (2009), pp C. Jonen, Efficient Pricing of High-Dimensional American-Style Derivatives: A Robust Regression Monte Carlo Method, Cologne, Germany, 2001
Computational Finance Least Squares Monte Carlo
Computational Finance Least Squares Monte Carlo School of Mathematics 2019 Monte Carlo and Binomial Methods In the last two lectures we discussed the binomial tree method and convergence problems. One
More informationThe Pennsylvania State University. The Graduate School. Department of Industrial Engineering AMERICAN-ASIAN OPTION PRICING BASED ON MONTE CARLO
The Pennsylvania State University The Graduate School Department of Industrial Engineering AMERICAN-ASIAN OPTION PRICING BASED ON MONTE CARLO SIMULATION METHOD A Thesis in Industrial Engineering and Operations
More information2.1 Mathematical Basis: Risk-Neutral Pricing
Chapter Monte-Carlo Simulation.1 Mathematical Basis: Risk-Neutral Pricing Suppose that F T is the payoff at T for a European-type derivative f. Then the price at times t before T is given by f t = e r(t
More informationRandom Tree Method. Monte Carlo Methods in Financial Engineering
Random Tree Method Monte Carlo Methods in Financial Engineering What is it for? solve full optimal stopping problem & estimate value of the American option simulate paths of underlying Markov chain produces
More informationValuing American Options by Simulation
Valuing American Options by Simulation Hansjörg Furrer Market-consistent Actuarial Valuation ETH Zürich, Frühjahrssemester 2008 Valuing American Options Course material Slides Longstaff, F. A. and Schwartz,
More informationCallable Libor exotic products. Ismail Laachir. March 1, 2012
5 pages 1 Callable Libor exotic products Ismail Laachir March 1, 2012 Contents 1 Callable Libor exotics 1 1.1 Bermudan swaption.............................. 2 1.2 Callable capped floater............................
More informationFinancial Mathematics and Supercomputing
GPU acceleration in early-exercise option valuation Álvaro Leitao and Cornelis W. Oosterlee Financial Mathematics and Supercomputing A Coruña - September 26, 2018 Á. Leitao & Kees Oosterlee SGBM on GPU
More informationMonte Carlo Methods in Structuring and Derivatives Pricing
Monte Carlo Methods in Structuring and Derivatives Pricing Prof. Manuela Pedio (guest) 20263 Advanced Tools for Risk Management and Pricing Spring 2017 Outline and objectives The basic Monte Carlo algorithm
More informationFast Convergence of Regress-later Series Estimators
Fast Convergence of Regress-later Series Estimators New Thinking in Finance, London Eric Beutner, Antoon Pelsser, Janina Schweizer Maastricht University & Kleynen Consultants 12 February 2014 Beutner Pelsser
More informationOptimal Search for Parameters in Monte Carlo Simulation for Derivative Pricing
Optimal Search for Parameters in Monte Carlo Simulation for Derivative Pricing Prof. Chuan-Ju Wang Department of Computer Science University of Taipei Joint work with Prof. Ming-Yang Kao March 28, 2014
More informationPricing Early-exercise options
Pricing Early-exercise options GPU Acceleration of SGBM method Delft University of Technology - Centrum Wiskunde & Informatica Álvaro Leitao Rodríguez and Cornelis W. Oosterlee Lausanne - December 4, 2016
More informationUniversity of Cape Town
The copyright of this thesis vests in the author. o quotation from it or information derived from it is to be published without full acknowledgement of the source. The thesis is to be used for private
More informationOptimized Least-squares Monte Carlo (OLSM) for Measuring Counterparty Credit Exposure of American-style Options
Optimized Least-squares Monte Carlo (OLSM) for Measuring Counterparty Credit Exposure of American-style Options Kin Hung (Felix) Kan 1 Greg Frank 3 Victor Mozgin 3 Mark Reesor 2 1 Department of Applied
More informationParallel Multilevel Monte Carlo Simulation
Parallel Simulation Mathematisches Institut Goethe-Universität Frankfurt am Main Advances in Financial Mathematics Paris January 7-10, 2014 Simulation Outline 1 Monte Carlo 2 3 4 Algorithm Numerical Results
More informationA hybrid approach to valuing American barrier and Parisian options
A hybrid approach to valuing American barrier and Parisian options M. Gustafson & G. Jetley Analysis Group, USA Abstract Simulation is a powerful tool for pricing path-dependent options. However, the possibility
More informationModelling the Sharpe ratio for investment strategies
Modelling the Sharpe ratio for investment strategies Group 6 Sako Arts 0776148 Rik Coenders 0777004 Stefan Luijten 0783116 Ivo van Heck 0775551 Rik Hagelaars 0789883 Stephan van Driel 0858182 Ellen Cardinaels
More informationMAFS5250 Computational Methods for Pricing Structured Products Topic 5 - Monte Carlo simulation
MAFS5250 Computational Methods for Pricing Structured Products Topic 5 - Monte Carlo simulation 5.1 General formulation of the Monte Carlo procedure Expected value and variance of the estimate Multistate
More informationEssays in Computational Finance
Essays in Computational Finance Niels Rom-Poulsen Ph.D. Dissertation Department of Finance Copenhagen Business School Thesis advisor: Carsten Sørensen April 2006 Contents Preface 4 1 English Summary 6
More informationImproved Greeks for American Options using Simulation
Improved Greeks for American Options using Simulation Pascal Letourneau and Lars Stentoft September 19, 2016 Abstract This paper considers the estimation of the so-called Greeks for American style options.
More informationApproximate Dynamic Programming for the Merchant Operations of Commodity and Energy Conversion Assets
Approximate Dynamic Programming for the Merchant Operations of Commodity and Energy Conversion Assets Selvaprabu (Selva) Nadarajah, (Joint work with François Margot and Nicola Secomandi) Tepper School
More informationEvaluating the Longstaff-Schwartz method for pricing of American options
U.U.D.M. Project Report 2015:13 Evaluating the Longstaff-Schwartz method for pricing of American options William Gustafsson Examensarbete i matematik, 15 hp Handledare: Josef Höök, Institutionen för informationsteknologi
More informationMONTE CARLO METHODS FOR AMERICAN OPTIONS. Russel E. Caflisch Suneal Chaudhary
Proceedings of the 2004 Winter Simulation Conference R. G. Ingalls, M. D. Rossetti, J. S. Smith, and B. A. Peters, eds. MONTE CARLO METHODS FOR AMERICAN OPTIONS Russel E. Caflisch Suneal Chaudhary Mathematics
More informationMonte Carlo Based Numerical Pricing of Multiple Strike-Reset Options
Monte Carlo Based Numerical Pricing of Multiple Strike-Reset Options Stavros Christodoulou Linacre College University of Oxford MSc Thesis Trinity 2011 Contents List of figures ii Introduction 2 1 Strike
More informationClaudia Dourado Cescato 1* and Eduardo Facó Lemgruber 2
Pesquisa Operacional (2011) 31(3): 521-541 2011 Brazilian Operations Research Society Printed version ISSN 0101-7438 / Online version ISSN 1678-5142 www.scielo.br/pope VALUATION OF AMERICAN INTEREST RATE
More informationFUNCTION-APPROXIMATION-BASED PERFECT CONTROL VARIATES FOR PRICING AMERICAN OPTIONS. Nomesh Bolia Sandeep Juneja
Proceedings of the 2005 Winter Simulation Conference M. E. Kuhl, N. M. Steiger, F. B. Armstrong, and J. A. Joines, eds. FUNCTION-APPROXIMATION-BASED PERFECT CONTROL VARIATES FOR PRICING AMERICAN OPTIONS
More informationPRICING AMERICAN OPTIONS WITH LEAST SQUARES MONTE CARLO ON GPUS. Massimiliano Fatica, NVIDIA Corporation
PRICING AMERICAN OPTIONS WITH LEAST SQUARES MONTE CARLO ON GPUS Massimiliano Fatica, NVIDIA Corporation OUTLINE! Overview! Least Squares Monte Carlo! GPU implementation! Results! Conclusions OVERVIEW!
More informationValuation of performance-dependent options in a Black- Scholes framework
Valuation of performance-dependent options in a Black- Scholes framework Thomas Gerstner, Markus Holtz Institut für Numerische Simulation, Universität Bonn, Germany Ralf Korn Fachbereich Mathematik, TU
More informationComputational Efficiency and Accuracy in the Valuation of Basket Options. Pengguo Wang 1
Computational Efficiency and Accuracy in the Valuation of Basket Options Pengguo Wang 1 Abstract The complexity involved in the pricing of American style basket options requires careful consideration of
More informationStochastic Grid Bundling Method
Stochastic Grid Bundling Method GPU Acceleration Delft University of Technology - Centrum Wiskunde & Informatica Álvaro Leitao Rodríguez and Cornelis W. Oosterlee London - December 17, 2015 A. Leitao &
More informationPerformance of the Producer Accumulator in Corn and Soybean Commodity Markets. Chad Te Slaa, Lisa Elliott, Matthew Elliott, and Zhiguang Wang
Performance of the Producer Accumulator in Corn and Soybean Commodity Markets by Chad Te Slaa, Lisa Elliott, Matthew Elliott, and Zhiguang Wang Suggested citation format: Slaa, C. T., L. Elliott, M. Elliott,
More informationAPPROXIMATING FREE EXERCISE BOUNDARIES FOR AMERICAN-STYLE OPTIONS USING SIMULATION AND OPTIMIZATION. Barry R. Cobb John M. Charnes
Proceedings of the 2004 Winter Simulation Conference R. G. Ingalls, M. D. Rossetti, J. S. Smith, and B. A. Peters, eds. APPROXIMATING FREE EXERCISE BOUNDARIES FOR AMERICAN-STYLE OPTIONS USING SIMULATION
More informationAmerican Option Pricing: A Simulated Approach
Utah State University DigitalCommons@USU All Graduate Plan B and other Reports Graduate Studies 5-2013 American Option Pricing: A Simulated Approach Garrett G. Smith Utah State University Follow this and
More informationComputational Finance Improving Monte Carlo
Computational Finance Improving Monte Carlo School of Mathematics 2018 Monte Carlo so far... Simple to program and to understand Convergence is slow, extrapolation impossible. Forward looking method ideal
More informationImproved Lower and Upper Bound Algorithms for Pricing American Options by Simulation
Improved Lower and Upper Bound Algorithms for Pricing American Options by Simulation Mark Broadie and Menghui Cao December 2007 Abstract This paper introduces new variance reduction techniques and computational
More informationIntroduction Dickey-Fuller Test Option Pricing Bootstrapping. Simulation Methods. Chapter 13 of Chris Brook s Book.
Simulation Methods Chapter 13 of Chris Brook s Book Christopher Ting http://www.mysmu.edu/faculty/christophert/ Christopher Ting : christopherting@smu.edu.sg : 6828 0364 : LKCSB 5036 April 26, 2017 Christopher
More informationAMERICAN OPTION PRICING WITH RANDOMIZED QUASI-MONTE CARLO SIMULATIONS. Maxime Dion Pierre L Ecuyer
Proceedings of the 2010 Winter Simulation Conference B. Johansson, S. Jain, J. Montoya-Torres, J. Hugan, and E. Yücesan, eds. AMERICAN OPTION PRICING WITH RANDOMIZED QUASI-MONTE CARLO SIMULATIONS Maxime
More informationRegression estimation in continuous time with a view towards pricing Bermudan options
with a view towards pricing Bermudan options Tagung des SFB 649 Ökonomisches Risiko in Motzen 04.-06.06.2009 Financial engineering in times of financial crisis Derivate... süßes Gift für die Spekulanten
More informationWeek 7 Quantitative Analysis of Financial Markets Simulation Methods
Week 7 Quantitative Analysis of Financial Markets Simulation Methods Christopher Ting http://www.mysmu.edu/faculty/christophert/ Christopher Ting : christopherting@smu.edu.sg : 6828 0364 : LKCSB 5036 November
More informationUsing Least Squares Monte Carlo techniques in insurance with R
Using Least Squares Monte Carlo techniques in insurance with R Sébastien de Valeriola sebastiendevaleriola@reacfincom Amsterdam, June 29 th 2015 Solvency II The major difference between Solvency I and
More informationMONTE CARLO BOUNDS FOR CALLABLE PRODUCTS WITH NON-ANALYTIC BREAK COSTS
MONTE CARLO BOUNDS FOR CALLABLE PRODUCTS WITH NON-ANALYTIC BREAK COSTS MARK S. JOSHI Abstract. The pricing of callable derivative products with complicated pay-offs is studied. A new method for finding
More informationCB Asset Swaps and CB Options: Structure and Pricing
CB Asset Swaps and CB Options: Structure and Pricing S. L. Chung, S.W. Lai, S.Y. Lin, G. Shyy a Department of Finance National Central University Chung-Li, Taiwan 320 Version: March 17, 2002 Key words:
More informationModern Methods of Option Pricing
Modern Methods of Option Pricing Denis Belomestny Weierstraß Institute Berlin Motzen, 14 June 2007 Denis Belomestny (WIAS) Modern Methods of Option Pricing Motzen, 14 June 2007 1 / 30 Overview 1 Introduction
More informationEC316a: Advanced Scientific Computation, Fall Discrete time, continuous state dynamic models: solution methods
EC316a: Advanced Scientific Computation, Fall 2003 Notes Section 4 Discrete time, continuous state dynamic models: solution methods We consider now solution methods for discrete time models in which decisions
More informationMonte Carlo Pricing of Bermudan Options:
Monte Carlo Pricing of Bermudan Options: Correction of super-optimal and sub-optimal exercise Christian Fries 12.07.2006 (Version 1.2) www.christian-fries.de/finmath/talks/2006foresightbias 1 Agenda Monte-Carlo
More informationOptimization Prof. A. Goswami Department of Mathematics Indian Institute of Technology, Kharagpur. Lecture - 18 PERT
Optimization Prof. A. Goswami Department of Mathematics Indian Institute of Technology, Kharagpur Lecture - 18 PERT (Refer Slide Time: 00:56) In the last class we completed the C P M critical path analysis
More informationSolving dynamic portfolio choice problems by recursing on optimized portfolio weights or on the value function?
DOI 0.007/s064-006-9073-z ORIGINAL PAPER Solving dynamic portfolio choice problems by recursing on optimized portfolio weights or on the value function? Jules H. van Binsbergen Michael W. Brandt Received:
More informationVariance Reduction Techniques for Pricing American Options using Function Approximations
Variance Reduction Techniques for Pricing American Options using Function Approximations Sandeep Juneja School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, India
More informationFISHER TOTAL FACTOR PRODUCTIVITY INDEX FOR TIME SERIES DATA WITH UNKNOWN PRICES. Thanh Ngo ψ School of Aviation, Massey University, New Zealand
FISHER TOTAL FACTOR PRODUCTIVITY INDEX FOR TIME SERIES DATA WITH UNKNOWN PRICES Thanh Ngo ψ School of Aviation, Massey University, New Zealand David Tripe School of Economics and Finance, Massey University,
More informationOmitted Variables Bias in Regime-Switching Models with Slope-Constrained Estimators: Evidence from Monte Carlo Simulations
Journal of Statistical and Econometric Methods, vol. 2, no.3, 2013, 49-55 ISSN: 2051-5057 (print version), 2051-5065(online) Scienpress Ltd, 2013 Omitted Variables Bias in Regime-Switching Models with
More informationAccelerated Option Pricing Multiple Scenarios
Accelerated Option Pricing in Multiple Scenarios 04.07.2008 Stefan Dirnstorfer (stefan@thetaris.com) Andreas J. Grau (grau@thetaris.com) 1 Abstract This paper covers a massive acceleration of Monte-Carlo
More informationRisk Estimation via Regression
Risk Estimation via Regression Mark Broadie Graduate School of Business Columbia University email: mnb2@columbiaedu Yiping Du Industrial Engineering and Operations Research Columbia University email: yd2166@columbiaedu
More informationAnurag Sodhi University of North Carolina at Charlotte
American Put Option pricing using Least squares Monte Carlo method under Bakshi, Cao and Chen Model Framework (1997) and comparison to alternative regression techniques in Monte Carlo Anurag Sodhi University
More informationMONTE CARLO EXTENSIONS
MONTE CARLO EXTENSIONS School of Mathematics 2013 OUTLINE 1 REVIEW OUTLINE 1 REVIEW 2 EXTENSION TO MONTE CARLO OUTLINE 1 REVIEW 2 EXTENSION TO MONTE CARLO 3 SUMMARY MONTE CARLO SO FAR... Simple to program
More informationEnergy Systems under Uncertainty: Modeling and Computations
Energy Systems under Uncertainty: Modeling and Computations W. Römisch Humboldt-University Berlin Department of Mathematics www.math.hu-berlin.de/~romisch Systems Analysis 2015, November 11 13, IIASA (Laxenburg,
More informationMonte Carlo Greeks in the lognormal Libor market model
Delft University of Technology Faculty of Electrical Engineering, Mathematics and Computer Science Delft Institute of Applied Mathematics Monte Carlo Greeks in the lognormal Libor market model A thesis
More informationMonte Carlo Introduction
Monte Carlo Introduction Probability Based Modeling Concepts moneytree.com Toll free 1.877.421.9815 1 What is Monte Carlo? Monte Carlo Simulation is the currently accepted term for a technique used by
More informationAnumericalalgorithm for general HJB equations : a jump-constrained BSDE approach
Anumericalalgorithm for general HJB equations : a jump-constrained BSDE approach Nicolas Langrené Univ. Paris Diderot - Sorbonne Paris Cité, LPMA, FiME Joint work with Idris Kharroubi (Paris Dauphine),
More informationMAFS Computational Methods for Pricing Structured Products
MAFS550 - Computational Methods for Pricing Structured Products Solution to Homework Two Course instructor: Prof YK Kwok 1 Expand f(x 0 ) and f(x 0 x) at x 0 into Taylor series, where f(x 0 ) = f(x 0 )
More information4 Reinforcement Learning Basic Algorithms
Learning in Complex Systems Spring 2011 Lecture Notes Nahum Shimkin 4 Reinforcement Learning Basic Algorithms 4.1 Introduction RL methods essentially deal with the solution of (optimal) control problems
More informationPORTFOLIO OPTIMIZATION AND EXPECTED SHORTFALL MINIMIZATION FROM HISTORICAL DATA
PORTFOLIO OPTIMIZATION AND EXPECTED SHORTFALL MINIMIZATION FROM HISTORICAL DATA We begin by describing the problem at hand which motivates our results. Suppose that we have n financial instruments at hand,
More informationCh 5. Several Numerical Methods
Ch 5 Several Numerical Methods I Monte Carlo Simulation for Multiple Variables II Confidence Interval and Variance Reduction III Solving Systems of Linear Equations IV Finite Difference Method ( 有限差分法
More informationKing s College London
King s College London University Of London This paper is part of an examination of the College counting towards the award of a degree. Examinations are governed by the College Regulations under the authority
More informationKing s College London
King s College London University Of London This paper is part of an examination of the College counting towards the award of a degree. Examinations are governed by the College Regulations under the authority
More informationRichardson Extrapolation Techniques for the Pricing of American-style Options
Richardson Extrapolation Techniques for the Pricing of American-style Options June 1, 2005 Abstract Richardson Extrapolation Techniques for the Pricing of American-style Options In this paper we re-examine
More informationThe Binomial Lattice Model for Stocks: Introduction to Option Pricing
1/33 The Binomial Lattice Model for Stocks: Introduction to Option Pricing Professor Karl Sigman Columbia University Dept. IEOR New York City USA 2/33 Outline The Binomial Lattice Model (BLM) as a Model
More informationPredicting Foreign Exchange Arbitrage
Predicting Foreign Exchange Arbitrage Stefan Huber & Amy Wang 1 Introduction and Related Work The Covered Interest Parity condition ( CIP ) should dictate prices on the trillion-dollar foreign exchange
More informationSDMR Finance (2) Olivier Brandouy. University of Paris 1, Panthéon-Sorbonne, IAE (Sorbonne Graduate Business School)
SDMR Finance (2) Olivier Brandouy University of Paris 1, Panthéon-Sorbonne, IAE (Sorbonne Graduate Business School) Outline 1 Formal Approach to QAM : concepts and notations 2 3 Portfolio risk and return
More informationSolving the Stochastic Steady-State Diffusion Problem Using Multigrid
Solving the Stochastic Steady-State Diffusion Problem Using Multigrid Tengfei Su Applied Mathematics and Scientific Computing Program Advisor: Howard Elman Department of Computer Science May 5, 2016 Tengfei
More informationEcon 582 Nonlinear Regression
Econ 582 Nonlinear Regression Eric Zivot June 3, 2013 Nonlinear Regression In linear regression models = x 0 β (1 )( 1) + [ x ]=0 [ x = x] =x 0 β = [ x = x] [ x = x] x = β it is assumed that the regression
More informationJournal of Computational and Applied Mathematics. The mean-absolute deviation portfolio selection problem with interval-valued returns
Journal of Computational and Applied Mathematics 235 (2011) 4149 4157 Contents lists available at ScienceDirect Journal of Computational and Applied Mathematics journal homepage: www.elsevier.com/locate/cam
More informationJaime Frade Dr. Niu Interest rate modeling
Interest rate modeling Abstract In this paper, three models were used to forecast short term interest rates for the 3 month LIBOR. Each of the models, regression time series, GARCH, and Cox, Ingersoll,
More informationA RIDGE REGRESSION ESTIMATION APPROACH WHEN MULTICOLLINEARITY IS PRESENT
Fundamental Journal of Applied Sciences Vol. 1, Issue 1, 016, Pages 19-3 This paper is available online at http://www.frdint.com/ Published online February 18, 016 A RIDGE REGRESSION ESTIMATION APPROACH
More informationConvergence of the Least Squares Monte-Carlo Approach to American Option Valuation
Convergence of the Least Squares Monte-Carlo Approach to American Option Valuation Lars Stentoft School of Economics & Management University of Aarhus 322 University Park DK-8000 Aarhus C, Denmark Email:
More informationRobust Optimization Applied to a Currency Portfolio
Robust Optimization Applied to a Currency Portfolio R. Fonseca, S. Zymler, W. Wiesemann, B. Rustem Workshop on Numerical Methods and Optimization in Finance June, 2009 OUTLINE Introduction Motivation &
More informationPolicy iterated lower bounds and linear MC upper bounds for Bermudan style derivatives
Finance Winterschool 2007, Lunteren NL Policy iterated lower bounds and linear MC upper bounds for Bermudan style derivatives Pricing complex structured products Mohrenstr 39 10117 Berlin schoenma@wias-berlin.de
More informationSimple Improvement Method for Upper Bound of American Option
Simple Improvement Method for Upper Bound of American Option Koichi Matsumoto (joint work with M. Fujii, K. Tsubota) Faculty of Economics Kyushu University E-mail : k-matsu@en.kyushu-u.ac.jp 6th World
More informationUniversity of California Berkeley
University of California Berkeley Improving the Asmussen-Kroese Type Simulation Estimators Samim Ghamami and Sheldon M. Ross May 25, 2012 Abstract Asmussen-Kroese [1] Monte Carlo estimators of P (S n >
More informationParallel American Monte Carlo
Parallel American Monte Carlo Calypso Herrera and Louis Paulot Misys arxiv:404.80v [q-fin.cp] 4 Apr 204 February 204 Abstract In this paper we introduce a new algorithm for American Monte Carlo that can
More informationA SIMPLE DERIVATION OF AND IMPROVEMENTS TO JAMSHIDIAN S AND ROGERS UPPER BOUND METHODS FOR BERMUDAN OPTIONS
A SIMPLE DERIVATION OF AND IMPROVEMENTS TO JAMSHIDIAN S AND ROGERS UPPER BOUND METHODS FOR BERMUDAN OPTIONS MARK S. JOSHI Abstract. The additive method for upper bounds for Bermudan options is rephrased
More informationMonte Carlo Methods in Financial Engineering
Paul Glassennan Monte Carlo Methods in Financial Engineering With 99 Figures
More informationReinforcement Learning and Simulation-Based Search
Reinforcement Learning and Simulation-Based Search David Silver Outline 1 Reinforcement Learning 2 3 Planning Under Uncertainty Reinforcement Learning Markov Decision Process Definition A Markov Decision
More informationAs we saw in Chapter 12, one of the many uses of Monte Carlo simulation by
Financial Modeling with Crystal Ball and Excel, Second Edition By John Charnes Copyright 2012 by John Charnes APPENDIX C Variance Reduction Techniques As we saw in Chapter 12, one of the many uses of Monte
More informationDesign of a Financial Application Driven Multivariate Gaussian Random Number Generator for an FPGA
Design of a Financial Application Driven Multivariate Gaussian Random Number Generator for an FPGA Chalermpol Saiprasert, Christos-Savvas Bouganis and George A. Constantinides Department of Electrical
More informationThe Valuation of Real Options with the Least Squares Monte Carlo Simulation Method
The Valuation of Real Options with the Least Squares Monte Carlo Simulation Method Artur Rodrigues Manuel J. Rocha Armada Management Research Unit - University of Minho, Portugal First version: February
More informationEARLY EXERCISE OPTIONS: UPPER BOUNDS
EARLY EXERCISE OPTIONS: UPPER BOUNDS LEIF B.G. ANDERSEN AND MARK BROADIE Abstract. In this article, we discuss how to generate upper bounds for American or Bermudan securities by Monte Carlo methods. These
More informationMonte Carlo Methods for Uncertainty Quantification
Monte Carlo Methods for Uncertainty Quantification Abdul-Lateef Haji-Ali Based on slides by: Mike Giles Mathematical Institute, University of Oxford Contemporary Numerical Techniques Haji-Ali (Oxford)
More informationMultistage risk-averse asset allocation with transaction costs
Multistage risk-averse asset allocation with transaction costs 1 Introduction Václav Kozmík 1 Abstract. This paper deals with asset allocation problems formulated as multistage stochastic programming models.
More informationUniversität Potsdam Institut für Informatik Lehrstuhl Maschinelles Lernen. Evaluation of Models. Niels Landwehr
Universität Potsdam Institut für Informatik ehrstuhl Maschinelles ernen Evaluation of Models Niels andwehr earning and Prediction Classification, Regression: earning problem Input: training data Output:
More informationNumerical Methods for Pricing Energy Derivatives, including Swing Options, in the Presence of Jumps
Numerical Methods for Pricing Energy Derivatives, including Swing Options, in the Presence of Jumps, Senior Quantitative Analyst Motivation: Swing Options An electricity or gas SUPPLIER needs to be capable,
More informationEquity correlations implied by index options: estimation and model uncertainty analysis
1/18 : estimation and model analysis, EDHEC Business School (joint work with Rama COT) Modeling and managing financial risks Paris, 10 13 January 2011 2/18 Outline 1 2 of multi-asset models Solution to
More informationCASE 6: INTEGRATED RISK ANALYSIS MODEL HOW TO COMBINE SIMULATION, FORECASTING, OPTIMIZATION, AND REAL OPTIONS ANALYSIS INTO A SEAMLESS RISK MODEL
ch11_4559.qxd 9/12/05 4:06 PM Page 527 Real Options Case Studies 527 being applicable only for European options without dividends. In addition, American option approximation models are very complex and
More informationDeakin Research Online
Deakin Research Online This is the authors final peer reviewed (post print) version of the item published as: Cheung, Joe and Corrado, Charles 2007, The cost of granting executive stock options with strike
More informationMartingale Pricing Theory in Discrete-Time and Discrete-Space Models
IEOR E4707: Foundations of Financial Engineering c 206 by Martin Haugh Martingale Pricing Theory in Discrete-Time and Discrete-Space Models These notes develop the theory of martingale pricing in a discrete-time,
More informationA Hidden Markov Model Approach to Information-Based Trading: Theory and Applications
A Hidden Markov Model Approach to Information-Based Trading: Theory and Applications Online Supplementary Appendix Xiangkang Yin and Jing Zhao La Trobe University Corresponding author, Department of Finance,
More informationPricing American Options with Monte Carlo Methods
Pricing American Options with Monte Carlo Methods Kellogg College University of Oxford A thesis submitted for the degree of MSc in Mathematical Finance Trinity 2018 Contents 1 Introduction and Overview
More informationSequential Decision Making
Sequential Decision Making Dynamic programming Christos Dimitrakakis Intelligent Autonomous Systems, IvI, University of Amsterdam, The Netherlands March 18, 2008 Introduction Some examples Dynamic programming
More informationAN IMPROVED BINOMIAL METHOD FOR PRICING ASIAN OPTIONS
Commun. Korean Math. Soc. 28 (2013), No. 2, pp. 397 406 http://dx.doi.org/10.4134/ckms.2013.28.2.397 AN IMPROVED BINOMIAL METHOD FOR PRICING ASIAN OPTIONS Kyoung-Sook Moon and Hongjoong Kim Abstract. We
More informationToward a coherent Monte Carlo simulation of CVA
Toward a coherent Monte Carlo simulation of CVA Lokman Abbas-Turki (Joint work with A. I. Bouselmi & M. A. Mikou) TU Berlin January 9, 2013 Lokman (TU Berlin) Advances in Mathematical Finance 1 / 16 Plan
More informationTo link to this article:
This article was downloaded by: [Centrum Wiskunde & Informatica] On: 24 July 2012, At: 02:56 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered
More informationROM Simulation with Exact Means, Covariances, and Multivariate Skewness
ROM Simulation with Exact Means, Covariances, and Multivariate Skewness Michael Hanke 1 Spiridon Penev 2 Wolfgang Schief 2 Alex Weissensteiner 3 1 Institute for Finance, University of Liechtenstein 2 School
More information