An analysis of faster convergence in certain finance applications for quasi-monte Carlo
|
|
- Bathsheba Horn
- 5 years ago
- Views:
Transcription
1 An analysis of faster convergence in certain finance applications for quasi-monte Carlo a,b a School of Mathematics and Statistics, University of NSW, Australia b Department of Computer Science, K.U.Leuven, Belgium 15th International Conference on Computing in Economics and Finance University of Technology, Sydney, Australia July 15 17, 2009
2 New things have happened Motivation A paper by Boyle, Lai and Tan (2005) discusses the usage of lattice rules (a quasi-monte Carlo technique) for derivative pricing. But: Shows very impressive results using quasi-monte Carlo methods. (Their paper is a good introduction to QMC for finance.) Lattice rules perform dramatically better than Monte Carlo and even Sobol (a favorite quasi-monte Carlo method in finance). Nevertheless: lattice rules are not the magic bullet. Fact: the periodization used is a very delicate process in practice. Since then, there is new technology and theory: Lattice sequences (instead of fixed lattice rules); Higher order digital nets. This talk tries to address these new developments.
3 The problem What is QMC? The underlying numerical problem we are solving is approximating I( f ) := f (x) dx, [0,1] s by an equal-weight quadrature/cubature rule Q( f, {x k } N 1 k=0 ) := 1 N 1 f (x k ). N k=0 If the points x k ( samples paths) are taken 1 (pseudo) randomly, then this the Monte Carlo method; 2 deterministically, then this is the Quasi-Monte Carlo method, using low-discrepancy points. E.g., using Sobol & Niederreiter sequences or lattice sequences.
4 The problem Derivative pricing... Lets assume a stock to adhere to S(t) S(t 0 ) e (µ σ2 /2) t + σ W(t), with W(t) BM(0, 1), and thus W(t) N(0, t), then for a discretization on 0 = t 0 < t 1 <... < t n = T we have with W := (W(t 1 ), W(t 2 ),..., W(t n )) N n (0, C), C i,j = min(t i, t j ).
5 The problem... as a multi-dimensional integral Since the price of a derivative contract is defined as the expected payoff; this expectation can be written as an integral over all possible underlier paths. Since W N n (0, C), the payoff is given by E(payoff) = for some factorization C = AA. Rn g(w) exp( 1 2 w C 1 w) dw (2π) n det(c) Rn = g(a z) exp( 1 2 z z) dz (2π) n = g(a Φ 1 (x)) dx, [0,1] n
6 Low-discrepancy point sets What sample points to use? Figure: Three point sets with each 64 samples in the unit square. 1 The product left-rectangle rule. Classical product rule Note: grids don t work for high dimensions since, e.g., taking the minimum 2 points per dimensions in 100 dimensions requires a total of = points , a quintillion 2 Pseudo-random numbers. Monte Carlo 3 Low-discrepancy points. Quasi-Monte Carlo
7 Low-discrepancy point sets What sample points to use? Figure: Three point sets with each 64 samples in the unit square. 1 The product left-rectangle rule. Classical product rule 2 Pseudo-random numbers. Monte Carlo (Fig: mt19937, the Mersenne Twister, with default initial state.) 3 Low-discrepancy points. Quasi-Monte Carlo (Fig: A good lattice sequence in base 3.)
8 Low-discrepancy point sets Lattice rules and sequences An N-point lattice rule with generating vector z Z s : x k = k z mod 1, for k = 0, 1,..., N 1. N A lattice sequence generates points x k = ϕ b (k) z mod 1, for k = 0, 1,..., with ϕ b a good permutation. E.g. radical inverse in base b. Figure: A lattice sequence in base 3 with maximal 729 = 3 6 points and z = [1, 140,...] stopped at 81, 100, 600, 700 and 729 points.
9 Low-discrepancy point sets Digital sequences (e.g., Sobol and Niederreiter sequence) A digital sequence in base b (for efficiency, think b = 2) generates points {x k } bm 1 k=0 by taking for the j-th dimension x k,j = C j k, i.e., C j,1,1 C j,1,m. =..... C j,m,1 C j,m,m x k,j,1 x k,j,m k 0. k m 1 over F b, where the x k,j,i, for i = 1,..., m, and k i, for i = 0,..., m 1, are the base b digits of x j and k, m m 1 x k,j = x k,j,i b i [0, 1), k = k i b i Z b m. i=1 i=0 (In reality this can be a little bit more complicated.)
10 Low-discrepancy point sets Lattice sequences Note: lattice here has *nothing* to do with binomial pricing. A lattice sequence in base b (again, think b = 2) generates points {x k } bm 1 k=0 by setting x k = ϕ b (k) z mod 1, where typically ϕ b is the radical inverse in base b (or its Gray code variant). E.g., the radical inverse φ b just reverses the digits: m 1 m 1 φ b (k) := k i b m 1, given k = k i b i. i=0 Typically for a digital sequence C 1 = I, the identity matrix, and for a lattice sequence z 1 = 1. Then the first dimensions coincide. (And form the van der Corput sequence.) i=0
11 Digital sequences versus lattice sequences Digital versus lattice sequences: Practical differences For a digital sequence one needs good generating matrices C 1, C 2,..., C s F m m b ; preferably base 2, then each of the columns of the matrices can be represented by an integer and adding up columns is done by xor ing; preferably the k s are taken in Gray code ordering such that only one column has to be xor d to the previous result when generating sequence elements. For a lattice sequence one needs a good generating vector z Z s b m ; multiplication modulo 1 is no problem at all; preferably base 2, then radical inverse can be done by bit masks in O(log 2 (m)); or Gray code variant by 2 assembly instructions.
12 Some examples of usage Pricing of an Asian option std. err asian-64-random asian-64-sobol asian-64-lattice asian-64-sobol-bb asian-64-lattice-bb asian-64-sobol-pca asian-64-lattice-pca n Figure: 64 dimensions, 10 random shifts
13 Some examples of usage Pricing of an Asian option Monte Carlo std. err Order-2 lattice n Figure: 100 dimensions, 10 random shifts
14 The need for speed A reprise on the multivariate integration We are interested in approximating I( f ) := f (x) dx [0,1] s by some quadrature / cubature rule of the form N 1 Q N ( f ; {x k } k, {w k } k ) := w k f (x k ). For moderate to high dimensions: equal weights w k = N 1 are nice, with random points (Monte Carlo, error O(N 1/2 )); or low-discrepancy points (quasi-monte Carlo, error O(N 1 )). Here: not so interested in high dimensions and wish error O(N α ). k=0
15 Smooth functions Smooth functions Consider the class H α s v 1,...,v s f (x) x v 1 1 xvs s of s-dimensional functions for which all are of BV for all 0 v i α 1. (Bounded variation (BV) in the sense of Hardy and Krause: s-dimensional.) E.g., if for a 1-dimensional function f we have (sufficient, not necessary) 1 0 f (x) dx <, then it is of bounded variation (BV). (In the sense of Vitali: 1-dimensional.)
16 Smooth functions Smooth functions Consider the class H α s v 1,...,v s f (x) x v 1 1 xvs s of s-dimensional functions for which all are of BV for all 0 v i α 1. (Bounded variation (BV) in the sense of Hardy and Krause: s-dimensional.) It follows that if (sufficient, not necessary) αs f (x) x α 1 xα s exists and is continuous on [0, 1] s, then f H α s. If this holds than we might expect the error I( f ) Q N ( f ) of a good cubature rule Q N to decrease like almost O(N α ).
17 Smooth functions Smooth periodic functions Consider a similar class E α s of s-dimensional functions for which all v 1,...,v s f (x) x v 1 1 xvs s are of BV for all 0 v i α 1 and additionally the multivariate analog of f (v) (1) = f (v) (0), 0 v α 2, holds: v 1,...,v s f (x) x v 1 1 = v 1,...,v s f (x) xvs s x v 1 1 xvs s for all j and 0 v i α 2. xj =1 xj =0
18 Smooth functions Then by a theorem of Zaremba (1968, 1972): the Fourier series of f Es α converges uniformly and the Fourier coefficients are bounded by ˆf (h) 3V α( f ) (2π) α r(h) α c r(h) α, (denote f E α s (c) for a fixed c) where r(h) := s r(h j ), r(h j ) := max(1, h j ), j=1 and V α ( f ) is a bound on the variation of (α 1)s f / x α 1 1 x α 1 s ; or if αs f / x α 1 xα s is continuous the largest maximum of over all choices of 0 v i α. v 1+ +v s f x v 1 1 xvs s
19 Lattice rules and periodization In come lattice rules... Suppose f Es α (c), then, using a (rank-1) lattice rule Q N ( f ; z) := 1 N 1 ( ) k z mod N f, N N k=0 the error is given in terms of the Fourier coefficients of f by Q N ( f ; z) I( f ) = ˆf (h) c 0 h Z s h z 0 (mod N) For a good lattice rule the last sum can be estimated as P α (z) := 0 h Z s h z 0 (mod N) 0 h Z s h z 0 (mod N) 1 r(h) α = O(N α (log N) α(s 1) ). 1 r(h) α.
20 Lattice rules and periodization... and lattice sequences Good lattice rules and good lattice sequences can be constructed by the fast component-by-component algorithm (Nuyens and Cools, 2005, 2006; and Cools, Kuo and Nuyens, 2006). With a good lattice sequence One can get successive approximations of lattice rules. By stopping at powers of the base b m. One can stop at any point (like with Monte Carlo). But then one can never do better than O(N 1 ), whatever the point set, see Hickernell, Kritzer, Kuo and Nuyens (2009). Using a weighted QMC algorithm (WQMC), one can stop at any point and have higher order of convergence O(N α ). New algorithm from Hickernell, Kritzer, Kuo and Nuyens (2009). Note: There is a published lattice sequence generator in Cools, Kuo and Nuyens, SIAM Journal on Scientific Computing, 28(6): , 2006.
21 Lattice rules and periodization Periodization Given f H α s, i.e., all v 1+ +v s f (x) x v 1 1 xvs s are of BV for all 0 v i α 1, then we want to replace f by F Es α for which 1 F(x) dx = [0,1] s f (x) dx. [0,1] s 2 3 v 1+ +v s F(x) x v 1 1 xvs s v 1,...,v s F(x) x v 1 1 xvs s xj =1 are of BV for all 0 v i α 1; = v 1,...,v s F(x) x v 1 1 xvs s xj =0 for all j and 0 v i α 2.
22 Lattice rules and periodization Variable transformation Given a smooth increasing function ϕ : [0, 1] [0, 1] for which ϕ(0) = 0 ϕ(1) = 1 ϕ (v) (0) = ϕ (v) (1) for v = 1,..., α 1, then set Periodizers by F(x) = f (ϕ(x 1 ),..., ϕ(x s )) ϕ (x 1 ) ϕ (x s ). Korobov (1963): polynomial forms; Sag & Szekeres (1964): tanh transform; Iri (1970): IMT transform; Mori (1978): double exponential transform; Sidi (1993): sin m forms; Laurie (1996): polynomial forms.
23 Lattice rules and periodization A weighted cubature formula As expliticized by Hickernell (2002), periodizing a function f gives a new weighted cubature rule Q N (F; g) = 1 N 1 f (ϕ(x k,1 ),..., ϕ(x k,s )) ϕ (x k,1 ) ϕ (x k,s ) N = k=0 N 1 k=0 s j=1 ϕ (x j ) f (ϕ(x k,1 ),..., ϕ(x k,s )) N s = Q N (f ; {ϕ(x k )} k, {N 1 ϕ (x k,j )} k ). j=1
24 Lattice rules and periodization A change of point set The stronger the periodization the more the points are pushed to the edges.
25 Lattice rules and periodization And non-equal weights equal weights! = 3! = 4! = The stronger the periodization the more the weights deviate from their original equal weight situation.
26 Lattice rules and periodization Some problems with this approach Korobov (1963) and Zaremba (1972) already show problems for increasing α and s. Recent work by Kuo, Sloan & Woźniakowski (2007) adds to this picture. However: Periodization can only work in low dimensions (say s 7). Periodization needs high precision. At least for calculating weights and points. Periodization costs time! But can be pre-calculated and traded for memory. Very impressive results by Boyle, Lai and Tan (2005) on derivative pricing. Nice and effective quadrature packages by Robinson et al.
27 Lattice rules and periodization Exit periodization, enter higher order nets? The paper by Kuo, Sloan and Woźniakwoski (2007), titled Periodization strategy may fail in high dimensions, has the following footnote: Since this paper was finished, we became aware of a result by Dick and Pillichshammer (2007): the optimal convergence rate of O(N α ), i.e., a rate matching the smoothness of the integrands, can be nearly achieved by digitally shifted polynomial lattice rules; moreover, the implied constant can be bounded independently of s under appropriate conditions on the weights. This further undermines the motivation for periodizing the integrands.
28 Higher order nets An explicit construction for higher order d Dick (2007, 2008,... ) gave an explicit construction based on the generating matrices of existing nets and sequences to get higher order. Given a (t, m, ds)-net or (t, ds)-sequence over F b with points in ds dimensions x k = ( x k,1 x k,2 x k,ds ), k = 0, 1,..., where x k,j = x k,j,1 b 1 + x k,j,2 b 2 + = i=1 x k,j,i b i, and all x k,j,i Z b. Then define new points in only s dimensions for which y k = ( y k,1 y k,2 y k,s ), y k,j = y k,j,1 b 1 + y k,j,2 b 2 + = i=1 v=1 It follows that y k,j,(i 1)d+v = x k,(j 1)d+v,i. d x k,(j 1)d+v,i b ((i 1)d+v).
29 Higher order nets Convergence What to expect when using such a higher order net / sequence up to N = b m points? For a function f Hs α one can construct a net of order d from a (t, m, ds)-net for which the error behaves like b min(α, d) max(0, m (t + s(d 1)/2 )). Then we need to have s(d 1) m > t +, 2 to see the higher order convergence of O(N d ).
30 Higher order nets Need for precision Assuming one picks basis b = 2, then a higher order net with N = 2 m points needs md bits. Using double precision with 53 bits of precision: d maximum N = 2 m possible On the other hand we need m > t sd + (s(d 1))/2. Using Niederreiter-Xing points, m min is s\d
31 Periodization versus higher order nets Periodization versus higher order nets Periodization by variable transformation blows up variation: possible exponential (in α and s) constant for convergence. Periodization needs high precision; mainly for calculating the weights and points. Periodization takes time, but can be pre-computed. Higher order nets are still equal-weight! Amazing! Higher order nets also need high precision. High precision is also directly needed in evaluating f ; unless f is periodic (see Dick (2007)); this is more problematic.
32 A lookback option Lookback option The payoff for a lookback call option with s discrete monitoring steps is given by P(S, T) = max(max(s(t 1 ),..., S(t n )) K, 0). In the paper by Boyle, Lai and Tan (2005) lattice rules are shown to do dramatically better than the Sobol sequence. Two reasons: 1 Black-Scholes kind of analytic solution in function of multivariate normal distribution. Genz (1992) did some work on approximating this integral. (Hard for high dimensions.) 2 For this function periodization works nice. The analytic solution works so well because there the integrand function is smooth!
33 A lookback option The solution The value of this option can be expressed as n V(S 0, K, r, σ, T) = exp( rt) S 0 exp(rt j ) H j I n j (1 L n ) K, where H j, I n j and L n are all multivariate normal probabilities j=1 1 b1 bs... exp( 1 Σ (2π) n 2 x Σ 1 x) dx, with different dimensions and covariance matrices.
34 Multivariate normal integrals Multivariate normal integrals Consider calculating 1 b1 bn exp( 1 Σ (2π) n 2 x Σ 1 x) dx, then following Genz (1992) this can be written as an in effect (n 1)-dimensional integral with 1 e 1 e 2 (e 1, w 1 ) e s (e 1:n 1, w 1:n 1 ) 0 dw, ( bi i 1 j=1 e i (e 1:i 1, w 1:i 1 ) = Φ c ) ijφ 1 (w j e j ) c ii and C the lower triangular Cholesky factorization of Σ.
35 Multivariate normal integrals Using WQMC For the numerical tests it is nice to see the whole convergence graph, not just powers of 2. Furthermore: that is the usual practice for Monte Carlo simulations. However, it can be shown that only O(N 1 ) can be obtained for all N. Therefore the graphs are made using a reweighted sum from Hickernell, Kritzer, Kuo & Nuyens (2009). For powers of 2 the approximations obtained by the WQMC algorithm are exactly the same as those for a standard QMC algorithm.
36 Multivariate normal integrals Mvn in 3 dimensions (2 dimensional integral) s= stderr (10 shifts) MC wlatseq baker wlatseq sin3 sobol ho3 sobol nx ho3 nx N
37 Multivariate normal integrals Mvn in 5 dimensions (4 dimensional integral) s= stderr (10 shifts) MC wlatseq baker wlatseq sin3 sobol ho3 sobol nx ho3 nx N
38 Multivariate normal integrals Mvn in 7 dimensions (6 dimensional integral) s= stderr (10 shifts) MC wlatseq baker wlatseq sin3 sobol ho3 sobol nx ho3 nx N
39 New things will happen Conclusion For the derivatives in Boyle, Lai and Tan (2005) lattice sequences work very well! Not so surprising. One can recover O(N α ), but α 1 should be carefully chosen such that periodization does not backfire. One should pre-calculate weights and points in high precision if pushing the limits. The new higher order nets are not yet up to the task, but look promising and are easy to use. The higher order nets perform better than plain Monte Carlo anyway and are very useful by that fact alone already. Anyone interested in software for lattice sequences or other quasi-monte Carlo techniques: please contact me! dirk.nuyens@cs.kuleuven.be
Quasi-Monte Carlo for Finance
Quasi-Monte Carlo for Finance Peter Kritzer Johann Radon Institute for Computational and Applied Mathematics (RICAM) Austrian Academy of Sciences Linz, Austria NCTS, Taipei, November 2016 Peter Kritzer
More informationQuasi-Monte Carlo for Finance Applications
Quasi-Monte Carlo for Finance Applications M.B. Giles F.Y. Kuo I.H. Sloan B.J. Waterhouse October 2008 Abstract Monte Carlo methods are used extensively in computational finance to estimate the price of
More informationQuasi-Monte Carlo for finance applications
ANZIAM J. 50 (CTAC2008) pp.c308 C323, 2008 C308 Quasi-Monte Carlo for finance applications M. B. Giles 1 F. Y. Kuo 2 I. H. Sloan 3 B. J. Waterhouse 4 (Received 14 August 2008; revised 24 October 2008)
More informationQuasi-Monte Carlo Methods in Financial Engineering: An Equivalence Principle and Dimension Reduction
Quasi-Monte Carlo Methods in Financial Engineering: An Equivalence Principle and Dimension Reduction Xiaoqun Wang,2, and Ian H. Sloan 2,3 Department of Mathematical Sciences, Tsinghua University, Beijing
More informationLecture outline. Monte Carlo Methods for Uncertainty Quantification. Importance Sampling. Importance Sampling
Lecture outline Monte Carlo Methods for Uncertainty Quantification Mike Giles Mathematical Institute, University of Oxford KU Leuven Summer School on Uncertainty Quantification Lecture 2: Variance reduction
More informationMonte Carlo Simulation of a Two-Factor Stochastic Volatility Model
Monte Carlo Simulation of a Two-Factor Stochastic Volatility Model asymptotic approximation formula for the vanilla European call option price. A class of multi-factor volatility models has been introduced
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 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 informationThe Use of Importance Sampling to Speed Up Stochastic Volatility Simulations
The Use of Importance Sampling to Speed Up Stochastic Volatility Simulations Stan Stilger June 6, 1 Fouque and Tullie use importance sampling for variance reduction in stochastic volatility simulations.
More informationGeometric tools for the valuation of performance-dependent options
Computational Finance and its Applications II 161 Geometric tools for the valuation of performance-dependent options T. Gerstner & M. Holtz Institut für Numerische Simulation, Universität Bonn, Germany
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 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 informationProbability. An intro for calculus students P= Figure 1: A normal integral
Probability An intro for calculus students.8.6.4.2 P=.87 2 3 4 Figure : A normal integral Suppose we flip a coin 2 times; what is the probability that we get more than 2 heads? Suppose we roll a six-sided
More informationMultilevel quasi-monte Carlo path simulation
Multilevel quasi-monte Carlo path simulation Michael B. Giles and Ben J. Waterhouse Lluís Antoni Jiménez Rugama January 22, 2014 Index 1 Introduction to MLMC Stochastic model Multilevel Monte Carlo Milstein
More informationAdaptive Quasi-Monte Carlo Where Each Integrand Value Depends on All Data Sites: the American Option
Adaptive Quasi-Monte Carlo Where Each Integrand Value Depends on All Data Sites: the American Option Lluís Antoni Jiménez Rugama Joint work with Fred J. Hickernell (IIT) and Da Li (IIT) Room 12, Bldg E1,
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 informationComputer Exercise 2 Simulation
Lund University with Lund Institute of Technology Valuation of Derivative Assets Centre for Mathematical Sciences, Mathematical Statistics Fall 2017 Computer Exercise 2 Simulation This lab deals with pricing
More informationFinancial Risk Modeling on Low-power Accelerators: Experimental Performance Evaluation of TK1 with FPGA
Financial Risk Modeling on Low-power Accelerators: Experimental Performance Evaluation of TK1 with FPGA Rajesh Bordawekar and Daniel Beece IBM T. J. Watson Research Center 3/17/2015 2014 IBM Corporation
More informationComputational Finance
Path Dependent Options Computational Finance School of Mathematics 2018 The Random Walk One of the main assumption of the Black-Scholes framework is that the underlying stock price follows a random walk
More informationEFFICIENCY IMPROVEMENT BY LATTICE RULES FOR PRICING ASIAN OPTIONS. Christiane Lemieux Pierre L Ecuyer
Proceedings of the 1998 Winter Simulation Conference D.J. Medeiros, E.F. Watson, J.S. Carson and M.S. Manivannan, eds. EFFICIENCY IMPROVEMENT BY LATTICE RULES FOR PRICING ASIAN OPTIONS Christiane Lemieux
More informationMath Computational Finance Option pricing using Brownian bridge and Stratified samlping
. Math 623 - Computational Finance Option pricing using Brownian bridge and Stratified samlping Pratik Mehta pbmehta@eden.rutgers.edu Masters of Science in Mathematical Finance Department of Mathematics,
More informationELEMENTS OF MONTE CARLO SIMULATION
APPENDIX B ELEMENTS OF MONTE CARLO SIMULATION B. GENERAL CONCEPT The basic idea of Monte Carlo simulation is to create a series of experimental samples using a random number sequence. According to the
More informationENHANCED QUASI-MONTE CARLO METHODS WITH DIMENSION REDUCTION
Proceedings of the 2002 Winter Simulation Conference E Yücesan, C-H Chen, J L Snowdon, J M Charnes, eds ENHANCED QUASI-MONTE CARLO METHODS WITH DIMENSION REDUCTION Junichi Imai Iwate Prefectural University,
More informationMonte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMSN50)
Monte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMSN50) Magnus Wiktorsson Centre for Mathematical Sciences Lund University, Sweden Lecture 2 Random number generation January 18, 2018
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 informationEfficient Deterministic Numerical Simulation of Stochastic Asset-Liability Management Models in Life Insurance
Efficient Deterministic Numerical Simulation of Stochastic Asset-Liability Management Models in Life Insurance Thomas Gerstner, Michael Griebel, Markus Holtz Institute for Numerical Simulation, University
More informationNumerical schemes for SDEs
Lecture 5 Numerical schemes for SDEs Lecture Notes by Jan Palczewski Computational Finance p. 1 A Stochastic Differential Equation (SDE) is an object of the following type dx t = a(t,x t )dt + b(t,x t
More informationOn the Use of Quasi-Monte Carlo Methods in Computational Finance
On the Use of Quasi-Monte Carlo Methods in Computational Finance Christiane Lemieux 1 and Pierre L Ecuyer 2 1 Department of Mathematics and Statistics, University of Calgary, 2500 University Drive N.W.,
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 informationChapter 2 Uncertainty Analysis and Sampling Techniques
Chapter 2 Uncertainty Analysis and Sampling Techniques The probabilistic or stochastic modeling (Fig. 2.) iterative loop in the stochastic optimization procedure (Fig..4 in Chap. ) involves:. Specifying
More informationPath Dependent British Options
Path Dependent British Options Kristoffer J Glover (Joint work with G. Peskir and F. Samee) School of Finance and Economics University of Technology, Sydney 18th August 2009 (PDE & Mathematical Finance
More informationA No-Arbitrage Theorem for Uncertain Stock Model
Fuzzy Optim Decis Making manuscript No (will be inserted by the editor) A No-Arbitrage Theorem for Uncertain Stock Model Kai Yao Received: date / Accepted: date Abstract Stock model is used to describe
More informationMonte Carlo Methods in Finance
Monte Carlo Methods in Finance Peter Jackel JOHN WILEY & SONS, LTD Preface Acknowledgements Mathematical Notation xi xiii xv 1 Introduction 1 2 The Mathematics Behind Monte Carlo Methods 5 2.1 A Few Basic
More information"Pricing Exotic Options using Strong Convergence Properties
Fourth Oxford / Princeton Workshop on Financial Mathematics "Pricing Exotic Options using Strong Convergence Properties Klaus E. Schmitz Abe schmitz@maths.ox.ac.uk www.maths.ox.ac.uk/~schmitz Prof. Mike
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 informationConditional sampling for barrier option pricing under the Heston model
Conditional sampling for barrier option pricing under the Heston model Nico Achtsis, Ronald Cools, and Dir Nuyens Abstract We propose a quasi-monte Carlo algorithm for pricing noc-out and noc-in barrier
More informationSTOCHASTIC CALCULUS AND BLACK-SCHOLES MODEL
STOCHASTIC CALCULUS AND BLACK-SCHOLES MODEL YOUNGGEUN YOO Abstract. Ito s lemma is often used in Ito calculus to find the differentials of a stochastic process that depends on time. This paper will introduce
More informationPractical example of an Economic Scenario Generator
Practical example of an Economic Scenario Generator Martin Schenk Actuarial & Insurance Solutions SAV 7 March 2014 Agenda Introduction Deterministic vs. stochastic approach Mathematical model Application
More informationOn the Scrambled Sobol sequences Lecture Notes in Computer Science 3516, , Springer 2005
On the Scrambled Sobol sequences Lecture Notes in Computer Science 3516, 775-782, Springer 2005 On the Scrambled Soboĺ Sequence Hongmei Chi 1, Peter Beerli 2, Deidre W. Evans 1, and Micheal Mascagni 2
More informationMath Computational Finance Double barrier option pricing using Quasi Monte Carlo and Brownian Bridge methods
. Math 623 - Computational Finance Double barrier option pricing using Quasi Monte Carlo and Brownian Bridge methods Pratik Mehta pbmehta@eden.rutgers.edu Masters of Science in Mathematical Finance Department
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 informationMATH3075/3975 FINANCIAL MATHEMATICS TUTORIAL PROBLEMS
MATH307/37 FINANCIAL MATHEMATICS TUTORIAL PROBLEMS School of Mathematics and Statistics Semester, 04 Tutorial problems should be used to test your mathematical skills and understanding of the lecture material.
More informationMath Option pricing using Quasi Monte Carlo simulation
. Math 623 - Option pricing using Quasi Monte Carlo simulation Pratik Mehta pbmehta@eden.rutgers.edu Masters of Science in Mathematical Finance Department of Mathematics, Rutgers University This paper
More informationContents Critique 26. portfolio optimization 32
Contents Preface vii 1 Financial problems and numerical methods 3 1.1 MATLAB environment 4 1.1.1 Why MATLAB? 5 1.2 Fixed-income securities: analysis and portfolio immunization 6 1.2.1 Basic valuation of
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 informationIEOR E4703: Monte-Carlo Simulation
IEOR E4703: Monte-Carlo Simulation Other Miscellaneous Topics and Applications of Monte-Carlo Martin Haugh Department of Industrial Engineering and Operations Research Columbia University Email: martin.b.haugh@gmail.com
More informationAn Efficient Quasi-Monte Carlo Simulation for Pricing Asian Options under Heston's Model
An Efficient Quasi-Monte Carlo Simulation for Pricing Asian Options under Heston's Model by Kewei Yu A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree
More informationStochastic Differential Equations in Finance and Monte Carlo Simulations
Stochastic Differential Equations in Finance and Department of Statistics and Modelling Science University of Strathclyde Glasgow, G1 1XH China 2009 Outline Stochastic Modelling in Asset Prices 1 Stochastic
More informationVaR Estimation under Stochastic Volatility Models
VaR Estimation under Stochastic Volatility Models Chuan-Hsiang Han Dept. of Quantitative Finance Natl. Tsing-Hua University TMS Meeting, Chia-Yi (Joint work with Wei-Han Liu) December 5, 2009 Outline Risk
More informationMonte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMS091)
Monte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMS091) Magnus Wiktorsson Centre for Mathematical Sciences Lund University, Sweden Lecture 3 Importance sampling January 27, 2015 M. Wiktorsson
More informationMonte Carlo Simulations
Monte Carlo Simulations Lecture 1 December 7, 2014 Outline Monte Carlo Methods Monte Carlo methods simulate the random behavior underlying the financial models Remember: When pricing you must simulate
More informationMath 416/516: Stochastic Simulation
Math 416/516: Stochastic Simulation Haijun Li lih@math.wsu.edu Department of Mathematics Washington State University Week 13 Haijun Li Math 416/516: Stochastic Simulation Week 13 1 / 28 Outline 1 Simulation
More informationA Matlab Program for Testing Quasi-Monte Carlo Constructions
A Matlab Program for Testing Quasi-Monte Carlo Constructions by Lynne Serré A research paper presented to the University of Waterloo in partial fulfillment of the requirements for the degree of Master
More informationMarket interest-rate models
Market interest-rate models Marco Marchioro www.marchioro.org November 24 th, 2012 Market interest-rate models 1 Lecture Summary No-arbitrage models Detailed example: Hull-White Monte Carlo simulations
More informationOn Complexity of Multistage Stochastic Programs
On Complexity of Multistage Stochastic Programs Alexander Shapiro School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205, USA e-mail: ashapiro@isye.gatech.edu
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 informationSTOCHASTIC VOLATILITY AND OPTION PRICING
STOCHASTIC VOLATILITY AND OPTION PRICING Daniel Dufresne Centre for Actuarial Studies University of Melbourne November 29 (To appear in Risks and Rewards, the Society of Actuaries Investment Section Newsletter)
More informationOutline. 1 Introduction. 2 Algorithms. 3 Examples. Algorithm 1 General coordinate minimization framework. 1: Choose x 0 R n and set k 0.
Outline Coordinate Minimization Daniel P. Robinson Department of Applied Mathematics and Statistics Johns Hopkins University November 27, 208 Introduction 2 Algorithms Cyclic order with exact minimization
More informationUsing Halton Sequences. in Random Parameters Logit Models
Journal of Statistical and Econometric Methods, vol.5, no.1, 2016, 59-86 ISSN: 1792-6602 (print), 1792-6939 (online) Scienpress Ltd, 2016 Using Halton Sequences in Random Parameters Logit Models Tong Zeng
More informationImplementing Models in Quantitative Finance: Methods and Cases
Gianluca Fusai Andrea Roncoroni Implementing Models in Quantitative Finance: Methods and Cases vl Springer Contents Introduction xv Parti Methods 1 Static Monte Carlo 3 1.1 Motivation and Issues 3 1.1.1
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 informationOption Pricing Models for European Options
Chapter 2 Option Pricing Models for European Options 2.1 Continuous-time Model: Black-Scholes Model 2.1.1 Black-Scholes Assumptions We list the assumptions that we make for most of this notes. 1. The underlying
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 informationFast narrow bounds on the value of Asian options
Fast narrow bounds on the value of Asian options G. W. P. Thompson Centre for Financial Research, Judge Institute of Management, University of Cambridge Abstract We consider the problem of finding bounds
More informationThe value of foresight
Philip Ernst Department of Statistics, Rice University Support from NSF-DMS-1811936 (co-pi F. Viens) and ONR-N00014-18-1-2192 gratefully acknowledged. IMA Financial and Economic Applications June 11, 2018
More informationMonte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMSN50)
Monte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMSN50) Magnus Wiktorsson Centre for Mathematical Sciences Lund University, Sweden Lecture 5 Sequential Monte Carlo methods I January
More informationFINANCIAL OPTION ANALYSIS HANDOUTS
FINANCIAL OPTION ANALYSIS HANDOUTS 1 2 FAIR PRICING There is a market for an object called S. The prevailing price today is S 0 = 100. At this price the object S can be bought or sold by anyone for any
More information10. Monte Carlo Methods
10. Monte Carlo Methods 1. Introduction. Monte Carlo simulation is an important tool in computational finance. It may be used to evaluate portfolio management rules, to price options, to simulate hedging
More informationExtend the ideas of Kan and Zhou paper on Optimal Portfolio Construction under parameter uncertainty
Extend the ideas of Kan and Zhou paper on Optimal Portfolio Construction under parameter uncertainty George Photiou Lincoln College University of Oxford A dissertation submitted in partial fulfilment for
More informationMonte Carlo Methods. Prof. Mike Giles. Oxford University Mathematical Institute. Lecture 1 p. 1.
Monte Carlo Methods Prof. Mike Giles mike.giles@maths.ox.ac.uk Oxford University Mathematical Institute Lecture 1 p. 1 Geometric Brownian Motion In the case of Geometric Brownian Motion ds t = rs t dt+σs
More informationGRAPHICAL ASIAN OPTIONS
GRAPHICAL ASIAN OPTIONS MARK S. JOSHI Abstract. We discuss the problem of pricing Asian options in Black Scholes model using CUDA on a graphics processing unit. We survey some of the issues with GPU programming
More informationYao s Minimax Principle
Complexity of algorithms The complexity of an algorithm is usually measured with respect to the size of the input, where size may for example refer to the length of a binary word describing the input,
More informationModule 4: Monte Carlo path simulation
Module 4: Monte Carlo path simulation Prof. Mike Giles mike.giles@maths.ox.ac.uk Oxford University Mathematical Institute Module 4: Monte Carlo p. 1 SDE Path Simulation In Module 2, looked at the case
More informationEFFICIENT MONTE CARLO ALGORITHM FOR PRICING BARRIER OPTIONS
Commun. Korean Math. Soc. 23 (2008), No. 2, pp. 285 294 EFFICIENT MONTE CARLO ALGORITHM FOR PRICING BARRIER OPTIONS Kyoung-Sook Moon Reprinted from the Communications of the Korean Mathematical Society
More informationMonte Carlo Methods in Financial Engineering
Paul Glassennan Monte Carlo Methods in Financial Engineering With 99 Figures
More informationMonte Carlo Methods for Uncertainty Quantification
Monte Carlo Methods for Uncertainty Quantification Mike Giles Mathematical Institute, University of Oxford Contemporary Numerical Techniques Mike Giles (Oxford) Monte Carlo methods 2 1 / 24 Lecture outline
More informationGuaranteed Fixed-Width Confidence Intervals for Monte Carlo and Quasi-Monte Carlo Simulation
Guaranteed Fixed-Width Confidence Intervals for Monte Carlo and Quasi-Monte Carlo Simulation Fred J. Hickernell Department of Applied Mathematics, Illinois Institute of Technology hickernell@iit.edu www.iit.edu/~hickernell
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 informationIEOR E4703: Monte-Carlo Simulation
IEOR E4703: Monte-Carlo Simulation Further Variance Reduction Methods Martin Haugh Department of Industrial Engineering and Operations Research Columbia University Email: martin.b.haugh@gmail.com Outline
More informationThe Binomial Lattice Model for Stocks: Introduction to Option Pricing
1/27 The Binomial Lattice Model for Stocks: Introduction to Option Pricing Professor Karl Sigman Columbia University Dept. IEOR New York City USA 2/27 Outline The Binomial Lattice Model (BLM) as a Model
More informationFinal exam solutions
EE365 Stochastic Control / MS&E251 Stochastic Decision Models Profs. S. Lall, S. Boyd June 5 6 or June 6 7, 2013 Final exam solutions This is a 24 hour take-home final. Please turn it in to one of the
More informationMATH4143: Scientific Computations for Finance Applications Final exam Time: 9:00 am - 12:00 noon, April 18, Student Name (print):
MATH4143 Page 1 of 17 Winter 2007 MATH4143: Scientific Computations for Finance Applications Final exam Time: 9:00 am - 12:00 noon, April 18, 2007 Student Name (print): Student Signature: Student ID: Question
More informationCS 774 Project: Fall 2009 Version: November 27, 2009
CS 774 Project: Fall 2009 Version: November 27, 2009 Instructors: Peter Forsyth, paforsyt@uwaterloo.ca Office Hours: Tues: 4:00-5:00; Thurs: 11:00-12:00 Lectures:MWF 3:30-4:20 MC2036 Office: DC3631 CS
More informationDynamic Portfolio Choice II
Dynamic Portfolio Choice II Dynamic Programming Leonid Kogan MIT, Sloan 15.450, Fall 2010 c Leonid Kogan ( MIT, Sloan ) Dynamic Portfolio Choice II 15.450, Fall 2010 1 / 35 Outline 1 Introduction to Dynamic
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 informationLecture Quantitative Finance Spring Term 2015
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
More informationThe British Russian Option
The British Russian Option Kristoffer J Glover (Joint work with G. Peskir and F. Samee) School of Finance and Economics University of Technology, Sydney 25th June 2010 (6th World Congress of the BFS, Toronto)
More informationResults for option pricing
Results for option pricing [o,v,b]=optimal(rand(1,100000 Estimators = 0.4619 0.4617 0.4618 0.4613 0.4619 o = 0.46151 % best linear combination (true value=0.46150 v = 1.1183e-005 %variance per uniform
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 informationNon-semimartingales in finance
Non-semimartingales in finance Pricing and Hedging Options with Quadratic Variation Tommi Sottinen University of Vaasa 1st Northern Triangular Seminar 9-11 March 2009, Helsinki University of Technology
More informationAN ANALYTICALLY TRACTABLE UNCERTAIN VOLATILITY MODEL
AN ANALYTICALLY TRACTABLE UNCERTAIN VOLATILITY MODEL FABIO MERCURIO BANCA IMI, MILAN http://www.fabiomercurio.it 1 Stylized facts Traders use the Black-Scholes formula to price plain-vanilla options. An
More informationMultilevel Monte Carlo for Basket Options
MLMC for basket options p. 1/26 Multilevel Monte Carlo for Basket Options Mike Giles mike.giles@maths.ox.ac.uk Oxford University Mathematical Institute Oxford-Man Institute of Quantitative Finance WSC09,
More informationOption Pricing for Discrete Hedging and Non-Gaussian Processes
Option Pricing for Discrete Hedging and Non-Gaussian Processes Kellogg College University of Oxford A thesis submitted in partial fulfillment of the requirements for the MSc in Mathematical Finance November
More informationSimulating more interesting stochastic processes
Chapter 7 Simulating more interesting stochastic processes 7. Generating correlated random variables The lectures contained a lot of motivation and pictures. We'll boil everything down to pure algebra
More informationThursday, March 3
5.53 Thursday, March 3 -person -sum (or constant sum) game theory -dimensional multi-dimensional Comments on first midterm: practice test will be on line coverage: every lecture prior to game theory quiz
More information1.1 Basic Financial Derivatives: Forward Contracts and Options
Chapter 1 Preliminaries 1.1 Basic Financial Derivatives: Forward Contracts and Options A derivative is a financial instrument whose value depends on the values of other, more basic underlying variables
More informationTime-changed Brownian motion and option pricing
Time-changed Brownian motion and option pricing Peter Hieber Chair of Mathematical Finance, TU Munich 6th AMaMeF Warsaw, June 13th 2013 Partially joint with Marcos Escobar (RU Toronto), Matthias Scherer
More informationLimit Theorems for the Empirical Distribution Function of Scaled Increments of Itô Semimartingales at high frequencies
Limit Theorems for the Empirical Distribution Function of Scaled Increments of Itô Semimartingales at high frequencies George Tauchen Duke University Viktor Todorov Northwestern University 2013 Motivation
More informationA GENERAL FORMULA FOR OPTION PRICES IN A STOCHASTIC VOLATILITY MODEL. Stephen Chin and Daniel Dufresne. Centre for Actuarial Studies
A GENERAL FORMULA FOR OPTION PRICES IN A STOCHASTIC VOLATILITY MODEL Stephen Chin and Daniel Dufresne Centre for Actuarial Studies University of Melbourne Paper: http://mercury.ecom.unimelb.edu.au/site/actwww/wps2009/no181.pdf
More informationWrite legibly. Unreadable answers are worthless.
MMF 2021 Final Exam 1 December 2016. This is a closed-book exam: no books, no notes, no calculators, no phones, no tablets, no computers (of any kind) allowed. Do NOT turn this page over until you are
More information