SearcharxivSearch

arXiv · 1304.4534

A variation of the Canadisation algorithm for the pricing of American options driven by L\'evy processes

Abstract

We introduce an algorithm for the pricing of finite expiry American options driven by L\'evy processes. The idea is to tweak Carr's `Canadisation' method, cf. Carr [9] (see also Bouchard et al [5]), in such a way that the adjusted algorithm is viable for any L\'evy process whose law at an independent, exponentially distributed time consists of a (possibly infinite) mixture of exponentials. This includes Brownian motion plus (hyper)exponential jumps, but also the recently introduced rich class of so-called meromorphic L\'evy processes, cf. Kyprianou et al [16]. This class contains all L\'evy processes whose L\'evy measure is an infinite mixture of exponentials which can generate both finite and infinite jump activity. L\'evy processes well known in mathematical finance can in a straightforward way be obtained as a limit of meromorphic L\'evy processes. We work out the algorithm in detail for the classic example of the American put, and we illustrate the results with some numerics.

Explore related subjects

Keep this discovery

BibTeXRIS

Florian Kleinert, Kees van Schaik. 2013-04-16. A variation of the Canadisation algorithm for the pricing of American options driven by L\'evy processes. https://arxiv.org/abs/1304.4534

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR