Search arXiv⌕ Search

arXiv · 0710.0850

Monte Carlo Methods and Path-Generation techniques for Pricing Multi-asset Path-dependent Options

Abstract

We consider the problem of pricing path-dependent options on a basket of underlying assets using simulations. As an example we develop our studies using Asian options. Asian options are derivative contracts in which the underlying variable is the average price of given assets sampled over a period of time. Due to this structure, Asian options display a lower volatility and are therefore cheaper than their standard European counterparts. This paper is a survey of some recent enhancements to improve efficiency when pricing Asian options by Monte Carlo simulation in the Black-Scholes model. We analyze the dynamics with constant and time-dependent volatilities of the underlying asset returns. We present a comparison between the precision of the standard Monte Carlo method (MC) and the stratified Latin Hypercube Sampling (LHS). In particular, we discuss the use of low-discrepancy sequences, also known as Quasi-Monte Carlo method (QMC), and a randomized version of these sequences, known as Randomized Quasi Monte Carlo (RQMC). The latter has proven to be a useful variance reduction technique for both problems of up to 20 dimensions and for very high dimensions. Moreover, we present and test a new path generation approach based on a Kronecker product approximation (KPA) in the case of time-dependent volatilities. KPA proves to be a fast generation technique and reduces the computational cost of the simulation procedure.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Piergiacomo Sabino. 2007-10-03. Monte Carlo Methods and Path-Generation techniques for Pricing Multi-asset Path-dependent Options. https://arxiv.org/abs/0710.0850

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Multiple SLEs and Dyson Brownian motion: transition density and Green's function

We consider multiple chordal Schramm-Loewner evolution (SLE) with $κ\in (0,4]$. Under common-time parameterization, we show that the transition density of the driving function of multiple chordal SLEs can be given by the transition density of Dyson Brownian motion and Green's function. This is a companion paper of [FWY24].

math.PR↗

Asymptotics of the free path length in the periodic Lorentz gas in the Boltzmann-Grad limit

We study the distribution of the free path length in the periodic Lorentz gas in the Boltzmann-Grad limit. For any unimodular Euclidean lattice and any smooth initial velocity distribution, we establish an asymptotic formula for the distribution function of the free path length with a polynomial rate of convergence. The proof combines the dynamical interpretation of the free path length in terms of expanding translates of horospherical orbits on the space of affine lattices, due to Marklof--Strömbergsson, with the effective equidistribution results of Kleinbock--Margulis and Kim. This extends the asymptotic formula of Boca--Zaharescu for the planar case to arbitrary dimension.

math.PR↗

The smallest singular value for rectangular random matrices with Lévy entries

Let $X=(x_{ij})\in\mathbb{R}^{N\times n}$ be a rectangular random matrix with i.i.d. entries (we assume $N/n\to\mathbf{a}>1$), and denote by $σ_{min}(X)$ its smallest singular value. When entries have mean zero and unit second moment, the celebrated work of Bai-Yin and Tikhomirov show that $n^{-\frac{1}{2}}σ_{min}(X)$ converges almost surely to $\sqrt{\mathbf{a}}-1.$ However, little is known when the second moment is infinite. In this work we consider symmetric entry distributions satisfying $\mathbb{P}(|x_{ij}|>t)\asymp t^{-α}$ for some $α\in(0,2)$, and prove that $σ_{min}(X)$ can be determined up to a log factor with high probability: for any $D>0$, with probability at least $1-n^{-D}$ we have $$C_1n^{\frac{1}α}(\log n)^\frac{2(α-2)}α\leq σ_{min}(X)\leq C_2n^{\frac{1}α}(\log n)^\frac{α-2}{2α}$$ for some constants $C_1,C_2>0$. The upper bound was derived in a recent work of Bao, Lee and Xu \cite{bao2024phase2} but the lower bound is new and answers a problem posed in that paper in a weaker form. This appears to be the first determination of $σ_{min}(X)$ in the $α$-stable case with a correct leading order of $n$, as previous anti-concentration arguments only yield lower bound $n^\frac{1}{2}$. The same lower bound holds for $σ_{min}(X+B)$ for any fixed rectangular matrix $B$ with no assumption on its operator norm. The case of diverging aspect ratio is also computed.

math.PR↗