This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Multinomial method for option pricing under Variance Gamma

\nameNicola Cantarutti\dagger and João Guerra\dagger Nicola Cantarutti. Email: nicolacantarutti@gmail.com \daggerCEMAPRE - Center for Applied Mathematics and Economics - ISEG - University of Lisbon.
Abstract

This paper presents a multinomial method for option pricing when the underlying asset follows an exponential Variance Gamma process. The continuous time Variance Gamma process is approximated by a continuous time process with the same first four cumulants, and then discretized in time and space. This approach is particularly convenient for pricing American and Bermudan options, which can be exercised before the expiration date. Numerical computations of European and American options are presented, and compared with results obtained with finite differences methods and with the Black-Scholes prices.

keywords:
American option, Lévy processes, Moment Matching, Multinomial tree, Variance Gamma.

1 Introduction

Since the early nineties, a lot of research has been done on the topic of pure jump Lévy processes to describe the dynamics of the asset returns. The main contributions are [5], [11], [13], [20].

Lévy processes are stochastic processes with independent and stationary increments that have nice analytical properties and reproduce quite well the statistical features of the financial data (see for instance [1] and [8]). In Figure 1 we present as examples the histograms of the daily log-returns for four of the major indices: the S&P 500 Stock Index, the KOSPI (Korea Composite Stock Price Index), XAO (All Ordinaries Australian Index) and TAIEX (Taiwan Capitalization weighted Stock Index). In the pictures we show the Normal and Variance Gamma (VG) densities fitted with the market data. It is straightforward to check that the VG density reproduces much better the high peaks near the origin, and the heavy tails feature.

The Variance Gamma process is a pure jump Lévy process with infinite activity. This means that when the magnitude of the jumps becomes infinitesimally small, the arrival rate of jumps tends to infinity. The first complete presentation of financial applications of the symmetric VG model is given in [20] where, with respect to the Gaussian model, an additional parameter is introduced in order to control the kurtosis (the skewness is not considered). The authors model the log-returns with a driftless Brownian motion whose variance is Gamma distributed. This is the origin of the name “Variance Gamma”.

Refer to caption
Refer to caption
Refer to caption
Refer to caption
Figure 1: Histograms of daily log-returns for S&P500, KOSPI, XAO and TAIEX. The dashed line corresponds to the VG density (10). The continuous line is the normal density. The parameters for both densities are obtained by the method of moments (details in [23]).

It is possible to give two representations to the VG process. In the first one, the VG process is obtained by time changing a Brownian motion with drift: the Brownian motion is evaluated at random times that are Gamma distributed. The economic interpretation is that the trading relevant times are indeed random. The non-symmetric VG process is described in [18], where the authors also present an explicit form of the density function, and a closed formula for the price of a vanilla European option. The authors consider a Brownian motion with a non-zero drift, and this additional parameter allows to control the skewness as well.

The VG process has an infinite number of jumps in any time interval and, unlike the Brownian motion, it does not have a continuous martingale component. Another important difference from the Brownian motion is that the VG process has finite variation, therefore the sum of the absolute value of the increments in any time interval converges. This fact can be derived easily from the second representation for VG processes: every VG can be represented as the difference of two (finite variation) Gamma processes. The proof can be found in [18], where the authors show that the two representations are equivalent, and also derive the VG characteristic function from the product of two Gamma characteristic functions. The second representation has an interesting economical interpretation: it can be seen as the difference of gains and losses. The Gamma processes are always increasing, therefore this representation is coherent with independent gains and losses processes.

The VG process was first presented in the context of option pricing in [19], where it has been used for pricing European options. European vanilla options can be easily priced by the analytical formula presented in [18] and exotics can be priced numerically by several techniques: Monte Carlo methods for VG are presented in [12]. A finite difference scheme for the VG Partial Integro-Differential Equation (PIDE) is described in [9]. In [7], the authors show how to price options by using a Fourier transform approach. The problem for American options is considered in [2], [3] and [15], where the authors present different finite difference schemes to solve the American VG PIDE.

The tree method was first introduced by [10] for a market where the log-price can change only in two different ways: an upward jump, or a downward jump. For this reason the model is called binomial model. The authors prove that when the number of time steps goes to infinity, the discrete random walk of the log-price converges to the Brownian motion and the option price converges to the Black-Scholes price ([6]). The multinomial model is a generalization of the binomial model, and at each time step it considers more than just two possible future states. A general multinomial method for pricing European and American options under exponential Lévy processes is described in [21]. In [16] the authors consider a multinomial method for general exponential Lévy processes based on the moment matching condition. Other methods based on the moment matching condition are for instance [14], with applications to the Normal Inverse Gaussian process, and [24] with applications to the VG process. In the present work we consider a multinomial discretization based on the cumulant matching condition as explained in [25], [26] and [27].

In Section 2 we present the basic features of Lévy processes, in particular finite variation processes. The VG process and exponential VG are introduced in the successive subsections. A short summary of some useful concepts such as integration with respect to the Poisson random measure, and the relation between the Lévy symbol and the cumulants are collected in the Appendices A and B. In Section 3 we review the construction of the multinomial tree, following the method of moment matching proposed in [25]. We prove that the multinomial tree converges to the continuous time jump process that we have introduced to approximate the VG process. In Section 4, which is the most important of the paper, we describe the algorithm for pricing options with the multinomial method and show the numerical results for European and American options. In Section 5 we present a topic that deserves further research. We show how to obtain the parameters of the discrete time Markov chain that approximates the jump process, by discretizing its infinitesimal generator. However, with this method the transition probabilities are not always positive. These probabilities, in general, are different from the probabilities obtained by the moment matching condition, but for a particular choice of the parameters we argue that the two must coincide. This topic needs to be further investigated. In Section 6 we present the conclusions.

2 Lévy processes

Let LtL_{t} be a stochastic process defined on a probability space (Ω,,(t0),)(\Omega,\mathcal{F},(\mathcal{F}_{t\geq 0}),\mathbb{P}), LtL_{t} is said to be a Lévy process if it satisfies the three properties:

  1. 1.

    L0=0L_{0}=0.

  2. 2.

    LtL_{t} has independent and stationary increments.

  3. 3.

    LtL_{t} is stochastically continuous: ϵ,t>0limh0(|Lt+hLt|>ϵ)=0.\forall\epsilon,t>0\;\;\lim_{h\to 0}\mathbb{P}\bigl{(}|L_{t+h}-L_{t}|>\epsilon\bigr{)}=0.

The characteristic function of a Lévy process LtL_{t} has the Lévy-Khintchine representation:

ϕLt(u)\displaystyle\phi_{L_{t}}(u) =𝔼[eiuLt]\displaystyle=\mathbb{E}[e^{iuL_{t}}] (1)
=etη(u)\displaystyle=e^{t\eta(u)}
=exp[t(ibu12σ~2u2+(eiux1iux𝟙{|x|<1})ν(dx))],\displaystyle=\exp\left[t\biggl{(}ibu-\frac{1}{2}\tilde{\sigma}^{2}u^{2}+\int_{\mathbb{R}}\bigl{(}e^{iux}-1-iux\mathbbm{1}_{\{|x|<1\}}\bigr{)}\nu(dx)\biggr{)}\right],

where η(u)\eta(u) is called Lévy symbol, bb\in\mathbb{R} and σ~0\tilde{\sigma}\geq 0 are constants111The diffusion coefficient is usually called σ\sigma. Here we use σ~\tilde{\sigma} because σ\sigma will be used for the VG process. and ν(dx)\nu(dx) is the Lévy measure which satisfies:

ν({0})=0,(1x2)ν(dx)<.\nu(\{0\})=0,\hskip 20.00003pt\int_{\mathbb{R}}(1\wedge x^{2})\nu(dx)<\infty. (2)

The Lévy triplet (b,σ~,ν)(b,\tilde{\sigma},\nu) completely characterizes a Lévy process. Every Lévy process can be written as the superposition of a drift, a Brownian motion and two pure jump processes. This is the so called Lévy-Itō decomposition:

dLt=bdt+σ~dWt+|x|1xN(dt,dx)+|x|<1xN~(dt,dx),dL_{t}=bdt+\tilde{\sigma}dW_{t}+\int_{|x|\geq 1}xN(dt,dx)+\int_{|x|<1}x\tilde{N}(dt,dx), (3)

where WtW_{t} is a standard Brownian motion, N(dt,dx)N(dt,dx) and N~(dt,dx)\tilde{N}(dt,dx) are the Poisson random measure and the compensated Poisson random measure (see Appendix A).

We are interested in particular in processes with finite variation and finite moments. We see that the Lévy measure contains all the information we need:

  • A Lévy process with triplet (b,σ~,ν)(b,\tilde{\sigma},\nu) is of finite variation if and only if

    σ~=0and|x|<1|x|ν(dx)<.\tilde{\sigma}=0\hskip 10.00002pt\mbox{and}\hskip 10.00002pt\int_{|x|<1}|x|\nu(dx)<\infty. (4)
  • A Lévy process has a finite moment of order nn, 𝔼[Xtn]<\mathbb{E}[X_{t}^{n}]<\infty, if and only if

    |x|1|x|nν(dx)<.\int_{|x|\geq 1}|x|^{n}\nu(dx)<\infty. (5)

For a proof see [4], Theorem 2.4.25 and Theorem 2.5.2. For processes with finite variation, the truncator term in (1) can be absorbed in the parameter b=b|x|<1xν(dx)b^{\prime}=b-\int_{|x|<1}x\nu(dx). It is easy to verify that every finite variation Lévy process can be represented as an integral of a Poisson random measure:

Lt=bt+\{0}xN(t,dx),L_{t}=b^{\prime}t+\int_{\mathbb{R}\backslash\{0\}}xN(t,dx), (6)

The Lévy symbol is:

η(u)=ibu+(eiux1)ν(dx).\eta(u)=ib^{\prime}u+\int_{\mathbb{R}}(e^{iux}-1)\nu(dx). (7)

2.1 The Variance Gamma process

The VG process is obtained by time changing a Brownian motion with drift. The new time variable is a stochastic process TtΓ(μt,κt)T_{t}\sim\Gamma(\mu t,\kappa t) with density222Usually the Gamma distribution is parametrized by a shape and scale positive parameters TΓ(ρ,ζ)T\sim\Gamma(\rho,\zeta). The Gamma process TtΓ(ρt,ζ)T_{t}\sim\Gamma(\rho t,\zeta) has pdf fTt(x)=ζρtΓ(ρt)xρt1exζf_{T_{t}}(x)=\frac{\zeta^{-\rho t}}{\Gamma(\rho t)}x^{\rho t-1}e^{-\frac{x}{\zeta}} and has moments 𝔼[Tt]=ρζt\mathbb{E}[T_{t}]=\rho\zeta t and Var[Tt]=ρζ2t\mbox{Var}[T_{t}]=\rho\zeta^{2}t. Here we use a parametrization as in [18] such that 𝔼[Tt]=μt\mathbb{E}[T_{t}]=\mu t and Var[Tt]=κt\mbox{Var}[T_{t}]=\kappa t, so ζ=κμ\zeta=\frac{\kappa}{\mu}, ρ=μ2κ\rho=\frac{\mu^{2}}{\kappa}.:

fTt(x)=(μκ)μ2tκΓ(μ2tκ)xμ2tκ1eμxκx0.f_{T_{t}}(x)=\frac{(\frac{\mu}{\kappa})^{\frac{\mu^{2}t}{\kappa}}}{\Gamma(\frac{\mu^{2}t}{\kappa})}x^{\frac{\mu^{2}t}{\kappa}-1}e^{-\frac{\mu x}{\kappa}}\hskip 20.00003ptx\geq 0. (8)

The Gamma process TtT_{t} is a subordinator. A subordinator is a one dimensional Lévy process that is non-decreasing almost surely. Therefore it is suitable to represent a time variable. It is possible to prove that every subordinator is a finite variation process (see [4]).

Considering a Brownian motion with drift Xt=θt+σWtX_{t}=\theta t+\sigma W_{t}, with Wt𝒩(0,t)W_{t}\sim\mathcal{N}(0,t), let’s replace the time variable by the Gamma subordinator TtΓ(t,κt)T_{t}\sim\Gamma(t,\kappa t) (with μ=1\mu=1). We obtain the Variance Gamma process:

Xt=θTt+σWTt.X_{t}=\theta T_{t}+\sigma W_{T_{t}}. (9)

It depends on three parameters:

  • θ\theta, the drift of the Brownian motion,

  • σ\sigma, the volatility of the Brownian motion,

  • κ\kappa, the variance of the Gamma process.

The probability density function of XtX_{t} can be computed conditioning on the realization of TtT_{t}:

fXt(x)\displaystyle f_{X_{t}}(x) =fXt,Tt(x,y)𝑑y=fXt|Tt(x|y)fTt(y)𝑑y\displaystyle=\int f_{X_{t},T_{t}}(x,y)dy=\int f_{X_{t}|T_{t}}(x|y)f_{T_{t}}(y)dy (10)
=01σ2πye(xθy)22σ2yytκ1κtκΓ(tκ)eyκ𝑑y\displaystyle=\int_{0}^{\infty}\frac{1}{\sigma\sqrt{2\pi y}}e^{-\frac{(x-\theta y)^{2}}{2\sigma^{2}y}}\frac{y^{\frac{t}{\kappa}-1}}{\kappa^{\frac{t}{\kappa}}\Gamma(\frac{t}{\kappa})}e^{-\frac{y}{\kappa}}\,dy
=2exp(θxσ2)κtκ2πσΓ(tκ)(x22σ2κ+θ2)t2κ14Ktκ12(1σ2x2(2σ2κ+θ2)),\displaystyle=\frac{2\exp(\frac{\theta x}{\sigma^{2}})}{\kappa^{\frac{t}{\kappa}}\sqrt{2\pi}\sigma\Gamma(\frac{t}{\kappa})}\biggl{(}\frac{x^{2}}{2\frac{\sigma^{2}}{\kappa}+\theta^{2}}\biggr{)}^{\frac{t}{2\kappa}-\frac{1}{4}}K_{\frac{t}{\kappa}-\frac{1}{2}}\biggl{(}\frac{1}{\sigma^{2}}\sqrt{x^{2}\bigl{(}\frac{2\sigma^{2}}{\kappa}+\theta^{2}\bigr{)}}\biggr{)},

where the function KK is a modified Bessel function of the second kind (see [18] for the computations). The characteristic function can be obtained by conditioning too:

ϕXt(u)\displaystyle\phi_{X_{t}}(u) =(1iκ(uθ+i2σ2u2))tκ\displaystyle=\biggl{(}1-i\kappa\bigl{(}u\theta+\frac{i}{2}\sigma^{2}u^{2}\bigr{)}\biggr{)}^{-\frac{t}{\kappa}} (11)
=(1iθκu+12σ2κu2)tκ,\displaystyle=\biggl{(}1-i\theta\kappa u+\frac{1}{2}\sigma^{2}\kappa u^{2}\biggr{)}^{-\frac{t}{\kappa}}, (12)

see proposition 1.3.27 in [4]. The Lévy symbol is:

η(u)=1κlog(1iθκu+12σ2κu2).\eta(u)=-\frac{1}{\kappa}\log(1-i\theta\kappa u+\frac{1}{2}\sigma^{2}\kappa u^{2}). (13)

Using the formula (70) in Appendix B for the cumulants we derive:

c1\displaystyle c_{1} =tθ\displaystyle=t\theta (14)
c2\displaystyle c_{2} =t(σ2+θ2κ)\displaystyle=t(\sigma^{2}+\theta^{2}\kappa)
c3\displaystyle c_{3} =t(2θ3κ2+3σ2θκ)\displaystyle=t(2\theta^{3}\kappa^{2}+3\sigma^{2}\theta\kappa)
c4\displaystyle c_{4} =t(3σ4κ+12σ2θ2κ2+6θ4κ3).\displaystyle=t(3\sigma^{4}\kappa+12\sigma^{2}\theta^{2}\kappa^{2}+6\theta^{4}\kappa^{3}).

The VG Lévy measure is333In [18] the authors derive the expression for the Lévy measure by representing the VG process as the difference of two Gamma processes.:

ν(dx)=eθxσ2κ|x|exp(2κ+θ2σ2σ|x|)dx,\nu(dx)=\frac{e^{\frac{\theta x}{\sigma^{2}}}}{\kappa|x|}\exp\left(-\frac{\sqrt{\frac{2}{\kappa}+\frac{\theta^{2}}{\sigma^{2}}}}{\sigma}|x|\right)dx, (15)

and it satisfies conditions (4) and (5). The VG process can be represented as a pure jump process as in (6) and (7), with no additional drift b=0b^{\prime}=0.

Xt=\{0}xN(t,dx).X_{t}=\int_{\mathbb{R}\backslash\{0\}}xN(t,dx). (16)

All the informations are contained in the Lévy measure (15), which completely describes the process. Even if the process has been created by Brownian subordination, it has no diffusion component. The Lévy triplet is (|x|<1xν(dx),0,ν)(\int_{|x|<1}x\nu(dx),0,\nu). Using the formalism of Poisson integrals in Appendix A, the Lévy symbol (13) has the representation444See Example 8.10 in [22].:

η(u)=(eiux1)ν(dx).\eta(u)=\int_{\mathbb{R}}(e^{iux}-1)\nu(dx). (17)

2.2 Exponential VG model

Under the risk neutral measure \mathbb{Q}, the dynamics of the stock price is described by an exponential Lévy model:

St=S0ert+Lt,S_{t}=S_{0}e^{rt+L_{t}}, (18)

where rr is the risk free interest rate, and LtL_{t} is a general Lévy process. Under \mathbb{Q}, the discounted price is a \mathbb{Q}-martingale:

𝔼[Stert|S0]=𝔼[S0eLt|S0]=S0,\mathbb{E}^{\mathbb{Q}}\bigl{[}S_{t}e^{-rt}\bigr{|}S_{0}\bigr{]}=\mathbb{E}^{\mathbb{Q}}\bigl{[}S_{0}e^{L_{t}}\bigr{|}S_{0}\bigr{]}=S_{0}, (19)

and thus 𝔼[eLt|L0=0]=1\mathbb{E}^{\mathbb{Q}}[e^{L_{t}}|L_{0}=0]=1. The condition for the existence of the exponential moment 𝔼[eLt]<\mathbb{E}[e^{L_{t}}]<\infty is equivalent to:

|x|>1exν(dx)<,\int_{|x|>1}e^{x}\nu(dx)<\infty, (20)

as proved in Lemma 25.7 in [22]. The VG process XtX_{t} has finite exponential moment. In order to satisfy the martingale condition555 To obtain the correction term ω\omega we have to find the exponential moment of XtX_{t} using its characteristic function: 𝔼[eXt]=ϕXt(i)=eωt\displaystyle\mathbb{E}[e^{X_{t}}]=\phi_{X_{t}}(-i)=e^{-\omega t} . we need to add a correction term to XtX_{t}. The following process is a martingale:

ertSt=S0eωt+Xt.e^{-rt}S_{t}=S_{0}e^{\omega t+X_{t}}. (21)

where w=1κlog(1θκ12σ2κ)w=\frac{1}{\kappa}\log(1-\theta\kappa-\frac{1}{2}\sigma^{2}\kappa). Passing to the log-price Yt=log(St)Y_{t}=\log(S_{t}), we get a process in the form of Eq. (6) with b=r+ωb^{\prime}=r+\omega:

Yt=Y0+(r+ω)t+\{0}xN(t,dx).Y_{t}=Y_{0}+(r+\omega)t+\int_{\mathbb{R}\backslash\{0\}}xN(t,dx). (22)

Let V(t,Yt)V(t,Y_{t}) be the value of an option at time tt. We assume that V(t,y)C1,1([t0,T],)V(t,y)\in C^{1,1}([t_{0},T],\mathbb{R}) and has a polynomial growth at infinity.
By the martingale pricing theory, the discounted price of the option is a martingale and it is possible to derive the PIDE for the price of the option:

𝔼[d(ertV(t,Yt))]=V(t,y)t+YtV(t,y)rV(t,y)=0,\mathbb{E}^{\mathbb{Q}}\biggl{[}d\bigl{(}e^{-rt}V(t,Y_{t})\bigr{)}\biggr{]}=\frac{\partial V(t,y)}{\partial t}+\mathcal{L}^{Y_{t}}V(t,y)-rV(t,y)=0, (23)

where Yt\mathcal{L}^{Y_{t}} is the infinitesimal generator of the log-price process (22). The resulting PIDE is:

V(t,y)t+(r+ω)V(t,y)y+\{0}[V(t,y+x)V(t,y)]ν(dx)=rV(t,y).\frac{\partial V(t,y)}{\partial t}+(r+\omega)\frac{\partial V(t,y)}{\partial y}+\int_{\mathbb{R}\backslash\{0\}}\bigl{[}V(t,y+x)-V(t,y)\bigr{]}\nu(dx)=rV(t,y). (24)

3 The multinomial method

In this section we introduce the multinomial method proposed in [27]. The stock price is considered as a Markov chain with LL possible future states at each time. In this setting, the time t[t0,T]t\in[t_{0},T] is discretized as tn=t0+nΔtt_{n}=t_{0}+n\Delta t for n=0,,Nn=0,...,N and Δt=(Tt0)/N\Delta t=(T-t_{0})/N. We denote the stock price at time tnt_{n} as S(tn)=SnS(t_{n})=S_{n}.

Consider the up/down factors u>d>0u>d>0 and write the discrete evolution of the stock price SnS_{n} as:

Sn+1=uLldl1Snl=1,,LS_{n+1}=u^{L-l}d^{l-1}S_{n}\hskip 30.00005ptl=1,...,L (25)

where each future state has transition probability plp_{l}, satisfying l=1Lpl=1\sum_{l=1}^{L}p_{l}=1. The value of the stock at time tnt_{n} can assume j[1,,n(L1)+1]j\in[1,...,n(L-1)+1] possible values:

Sn(j)=un(Ll)+1jdj1S0.S_{n}^{(j)}=u^{n(L-l)+1-j}d^{j-1}S_{0}. (26)

The multinomial tree is recombining if for a constant c>1c>1, u/d=cu/d=c. Regarding the present work, we only consider five branches, L=5L=5. As explained in [27], this number of branches is enough to model the features of a stochastic process up to its fourth moment.

3.1 Moment matching

To determine the parameters of the Markov chain we require that its local moments are equal to that of the continuous process. First, we rewrite the continuous process (22) as the sum of a drift term and a martingale term:

Yt+ΔtYt\displaystyle Y_{t+\Delta t}-Y_{t} =(r+ω)Δt+\{0}xN(Δt,dx)\displaystyle=(r+\omega)\Delta t+\int_{\mathbb{R}\backslash\{0\}}xN(\Delta t,dx) (27)
=(r+ω+θ)Δt+\{0}xN~(Δt,dx)\displaystyle=(r+\omega+\theta)\Delta t+\int_{\mathbb{R}\backslash\{0\}}x\tilde{N}(\Delta t,dx)

where θ=\{0}xν(dx)=𝔼[\{0}xN(1,dx)]\theta=\int_{\mathbb{R}\backslash\{0\}}x\nu(dx)=\mathbb{E}\bigl{[}\int_{\mathbb{R}\backslash\{0\}}xN(1,dx)\bigr{]} is the expected value of the VG process in 16, when Δt=1\Delta t=1. The integral with respect to the compensated Poisson measure N~(Δt,dx)\tilde{N}(\Delta t,dx) is a martingale (see Appendix A).

We can pass to log-prices Yn=log(Sn)Y_{n}=\log(S_{n}) in the discrete Eq. (25), and write it as the sum of a drift component and a random variable with LL possible outcomes:

ΔY=Yn+1Yn\displaystyle\Delta Y=Y_{n+1}-Y_{n} =(Ll)log(u)+(l1)log(d)\displaystyle=(L-l)\log(u)+(l-1)\log(d) (28)
=b¯Δt+(L2l+1)α(Δt).\displaystyle=\bar{b}\,\Delta t+(L-2l+1)\alpha(\Delta t).

The term b¯Δt\bar{b}\,\Delta t is the drift term, while ll is a random variable that assumes values in [1,2,,L][1,2,...,L] with probability plp_{l}. It has to satisfy the martingale condition:

𝔼[(L2l+1)α(Δt)]=α(Δt)l=1Lpl(L2l+1)=0,\mathbb{E}\bigl{[}(L-2l+1)\alpha(\Delta t)\bigr{]}=\alpha(\Delta t)\sum_{l=1}^{L}p_{l}(L-2l+1)=0,

with α(Δt)\alpha(\Delta t) a function of Δt\Delta t.

The corresponding up/down factors have the following representation:

u=exp(bL1+α(Δt))d=exp(bL1α(Δt)),u=\exp\biggl{(}\frac{b}{L-1}+\alpha(\Delta t)\biggr{)}\hskip 20.00003ptd=\exp\biggl{(}\frac{b}{L-1}-\alpha(\Delta t)\biggr{)}, (29)

and we can readily see that if u/du/d is constant the tree recombines.

Given the mean c1=𝔼[ΔY]=b¯Δtc_{1}=\mathbb{E}[\Delta Y]=\bar{b}\Delta t, the kk-central moment is:

𝔼[(ΔYc1)k]=α(Δt)k𝔼[(L2l+1)k].\mathbb{E}\bigl{[}(\Delta Y-c_{1})^{k}\bigr{]}=\alpha(\Delta t)^{k}\,\mathbb{E}\bigl{[}(L-2l+1)^{k}\bigr{]}. (30)

The moment matching condition requires that the central moments of the discrete process (28) are equal to the central moments of the continuous process (27):

α(Δt)k𝔼[(L2l+1)k]=μk.\alpha(\Delta t)^{k}\,\mathbb{E}\bigl{[}(L-2l+1)^{k}\bigr{]}=\mu_{k}. (31)

We fix L=5L=5, and using the relation between central moments and cumulants (Eq. (71) in Appendix B) we solve the linear system of equations for the transition probabilities:

p1\displaystyle p_{1} =1196α(t)4[32c222c2α(t)2+2c3α(t)+12c4]\displaystyle=\frac{1}{196\alpha(t)^{4}}\biggl{[}\frac{3}{2}c_{2}^{2}-2c_{2}\alpha(t)^{2}+2c_{3}\alpha(t)+\frac{1}{2}c_{4}\biggr{]} (32)
p2\displaystyle p_{2} =1196α(t)4[6c2+32c2α(t)24c3α(t)2c4]\displaystyle=\frac{1}{196\alpha(t)^{4}}\biggl{[}-6c_{2}+32c_{2}\alpha(t)^{2}-4c_{3}\alpha(t)-2c_{4}\biggr{]}
p3\displaystyle p_{3} =1+1196α(t)4[3c4+9c2260c2α(t)2]\displaystyle=1+\frac{1}{196\alpha(t)^{4}}\biggl{[}3c_{4}+9c_{2}^{2}-60c_{2}\alpha(t)^{2}\biggr{]}
p4\displaystyle p_{4} =1196α(t)4[6c2+32c2α(t)2+4c3α(t)2c4]\displaystyle=\frac{1}{196\alpha(t)^{4}}\biggl{[}-6c_{2}+32c_{2}\alpha(t)^{2}+4c_{3}\alpha(t)-2c_{4}\biggr{]}
p5\displaystyle p_{5} =1196α(t)4[32c222c2α(t)22c3α(t)+12c4].\displaystyle=\frac{1}{196\alpha(t)^{4}}\biggl{[}\frac{3}{2}c_{2}^{2}-2c_{2}\alpha(t)^{2}-2c_{3}\alpha(t)+\frac{1}{2}c_{4}\biggr{]}.

The drift parameter is b¯=r+ω+θ\bar{b}=r+\omega+\theta. The only missing parameter to determine is α(Δt)\alpha(\Delta t). This is a function of the time increment Δt\Delta t and can be determined using the higher order terms in the moment matching condition together with the condition of positive probabilities.

Recall that the well known binomial model [10] assumes the value α(Δt)=σ~Δt\alpha(\Delta t)=\tilde{\sigma}\sqrt{\Delta t}, that represents the volatility of the increments in the time interval Δt\Delta t. In the trinomial model, the parameter α(Δt)\alpha(\Delta t) assumes value α(Δt)=12σ~3Δt\alpha(\Delta t)=\frac{1}{2}\tilde{\sigma}\sqrt{3\Delta t}, see for instance [25]. For the multinomial method a good representation for α(Δt)\alpha(\Delta t) is:

α(Δt)=c23+κ¯12,\alpha(\Delta t)=\sqrt{c_{2}}\sqrt{\frac{3+\bar{\kappa}}{12}}, (33)

where κ¯=c4/c22\bar{\kappa}=c_{4}/c_{2}^{2} is the excess of kurtosis666We use the bar over κ\kappa, to distinguish the kurtosis from the variance of the gamma process κ\kappa.. We refer to [27] for the derivation. This choice guarantees that the probabilities pip_{i} for i=15i=1...5 are always positive and sum to one. We can replace the expression (33) inside (32), to obtain the simpler form:

[p1,p2,p3,p4,p5][3+κ¯+s9+3κ¯4(3+κ¯)2,3+κ¯s9+3κ¯2(3+κ¯)2,\displaystyle[p_{1},p_{2},p_{3},p_{4},p_{5}]\approx\biggl{[}\frac{3+\bar{\kappa}+s\sqrt{9+3\bar{\kappa}}}{4(3+\bar{\kappa})^{2}},\frac{3+\bar{\kappa}-s\sqrt{9+3\bar{\kappa}}}{2(3+\bar{\kappa})^{2}}, (34)
3+2κ¯2(3+κ¯),3+κ¯+s9+3κ¯2(3+κ¯)2,3+κ¯s9+3κ¯4(3+κ¯)2],\displaystyle\frac{3+2\bar{\kappa}}{2(3+\bar{\kappa})},\frac{3+\bar{\kappa}+s\sqrt{9+3\bar{\kappa}}}{2(3+\bar{\kappa})^{2}},\frac{3+\bar{\kappa}-s\sqrt{9+3\bar{\kappa}}}{4(3+\bar{\kappa})^{2}}\biggr{]},

where s=c3/c23s=c_{3}/\sqrt{c_{2}^{3}} is the skewness.

Remark 1.

The standard deviation of every Lévy process with finite moments follows the square root rule. This means that the term α(Δt)\alpha(\Delta t) has to be proportional to the square root of Δt\Delta t. In the binomial and trinomial models, the proportionality constant is explicit, while for the pentanomial method it is implicit in the formula (33). Expanding the formula using the expression (14) for the cumulants, it is possible to check that the square root rule is satisfied at first order in Δt\sqrt{\Delta t}.

3.2 Convergence

We call a generic jump process (6) with first four cumulants c1c_{1},c2c_{2},c3c_{3},c4c_{4} equal to the VG cumulants (14), the approximated process XAX^{A}. The cumulant generating function of the increment ΔXA\Delta X^{A} has the following series representation (see Appendix (B)):

HΔXA(u)=ic1uc2u22ic3u33!+c4u44!+𝒪(u5).H_{\Delta X^{A}}(u)=ic_{1}u-\frac{c_{2}u^{2}}{2}-\frac{ic_{3}u^{3}}{3!}+\frac{c_{4}u^{4}}{4!}+\mathcal{O}(u^{5}). (35)

We are interested in the approximation of a VG process with drift (27), therefore we require that c1=b¯Δt=(r+ω+θ)Δtc_{1}=\bar{b}\Delta t=(r+\omega+\theta)\Delta t.

Theorem 3.1.

The increments of the discrete Markov chain (28) and the increments of the approximated process XAX^{A} have the same distribution by construction.

Proof.

The idea of the proof is to show that the cumulant generating function of the discrete process (28) coincides with that of the approximated process (35). We prove it using the moment matching condition (31).

HΔY(u)\displaystyle H_{\Delta Y}(u) =log(ϕΔY(u))=log(𝔼[eiuΔY])\displaystyle=\log\bigl{(}\phi_{\Delta Y}(u)\bigr{)}=\log\biggl{(}\mathbb{E}\bigl{[}e^{iu\Delta Y}\bigr{]}\biggr{)} (36)
=log(𝔼[eiu(b¯Δt+(L2l+1)α(Δt))])\displaystyle=\log\biggl{(}\mathbb{E}\biggl{[}e^{iu\bigl{(}\bar{b}\Delta t+(L-2l+1)\alpha(\Delta t)\bigr{)}}\biggr{]}\biggr{)}
=iub¯Δt+log(𝔼[eiu((L2l+1)α(Δt))]).\displaystyle=iu\bar{b}\Delta t+\log\biggl{(}\mathbb{E}\biggl{[}e^{iu\bigl{(}(L-2l+1)\alpha(\Delta t)\bigr{)}}\biggr{]}\biggr{)}.

We can expand the exponential function in Taylor series and use the moment matching condition (31) to obtain:

HΔY(u)\displaystyle H_{\Delta Y}(u) =iub¯Δt+log(k=0(iu)kk!(α(Δt))k𝔼[(L2l+1)k])\displaystyle=iu\bar{b}\Delta t+\log\biggl{(}\sum_{k=0}^{\infty}\frac{(iu)^{k}}{k!}\bigl{(}\alpha(\Delta t)\bigr{)}^{k}\mathbb{E}\biggl{[}\bigl{(}L-2l+1\bigr{)}^{k}\biggr{]}\biggr{)} (37)
=iub¯Δt+log(k=0(iu)kk!μk)\displaystyle=iu\bar{b}\Delta t+\log\biggl{(}\sum_{k=0}^{\infty}\frac{(iu)^{k}}{k!}\mu_{k}\biggr{)}
=iuc1+k=0(iu)kk!ck\displaystyle=iuc_{1}+\sum_{k=0}^{\infty}\frac{(iu)^{k}}{k!}c_{k}
=HΔXA(u),\displaystyle=H_{\Delta X^{A}}(u),

Remark 2.

All the cumulants of ΔXA\Delta X^{A} are equal to the cumulants of the Markov chain (28) by construction, but only the first four are equal to the VG cumulants. When all the cumulants cic_{i}, for 0in0\leq i\leq n, are equal to the VG cumulants, the approximated process XAX^{A} converges to the original VG process for nn\to\infty. To control nn cumulants, we need n+1n+1 branches. Therefore, when the number of cumulants of ΔXA\Delta X^{A} equal to those of the VG process goes to infinity, the number of branches have to go to infinity as well. We assume that five branches (L=5L=5) are enough to describe the features of the underlying process and, at the same time, keep the numerical problem simple.

Theorem 3.2.

The distribution of the pentanomial tree at time NN converges to the distribution of a compound Poisson process at time NN with L=5L=5 possible jump sizes and activity λ=32κ¯N\lambda=\frac{3}{2\bar{\kappa}N}, when Δt0\Delta t\to 0.

For the proof of this theorem we refer to Section 4.2 of [27]. The authors first define the jump sizes and their respective probabilities, and then prove that when Δt0\Delta t\to 0 the characteristic function of the pentanomial tree converges to the characteristic function of the compound Poisson process.

4 Numerical results

In this section we present the steps to implement the algorithm for pricing European and American options with the multinomial method. Then we compare the results with those obtained by the PIDE method and Black-Scholes model.

4.1 Algorithm

We suggest the following algorithm for pricing with the multinomial method:

  1. 1.

    Compute the transition probabilities vector (34).

  2. 2.

    Compute the up/down factors uu and dd (29) and the vector of prices SNS_{N} at terminal time NN as in Eq. (26).

  3. 3.

    Evaluate the payoff of the option VN(SN)V^{N}(S_{N}) at terminal time NN.

  4. 4.

    Given the option’s values at time tn+1t_{n+1} compute the values at time tnt_{n}. The value is the conditional expectation:

    Vn(sn(k))=erΔt𝔼[Vn+1(Sn+1)|Sn(k)=sn(k)].V^{n}(s^{(k)}_{n})=e^{-r\Delta t}\mathbb{E}^{\mathbb{Q}}\biggl{[}V^{n+1}(S_{n+1})\bigg{|}S^{(k)}_{n}=s^{(k)}_{n}\biggr{]}. (38)
  5. 5.

    If computing the price of an American option, the value at the previous time level is the maximum between the conditional expectation and the intrinsic value of the option. For an American put we have:

    Vn(sn(k))=max{erΔt𝔼[Vn+1(Sn+1)|Sn(k)=sn(k)],Ksn(k)}.V^{n}(s^{(k)}_{n})=\max\biggr{\{}e^{-r\Delta t}\mathbb{E}^{\mathbb{Q}}\biggl{[}V^{n+1}(S_{n+1})\bigg{|}S^{(k)}_{n}=s^{(k)}_{n}\biggr{]},K-s^{(k)}_{n}\biggr{\}}. (39)
  6. 6.

    Iterate the algorithm until the initial time t0t_{0}.

In the parameters calibration procedure, sometimes it is common to estimate first the historical parameters, and use them as initial guess for the least squares minimization that recovers the risk neutral parameters. In [23] are presented several methods for historical parameters estimation of the VG density. We use the simple method of moments to estimate the parameters for the data in Fig. 1. In all future calculations we consider the risk neutral VG parameters in Table 4.1.

\tbl

rr is the risk free interest rate and θ,σ,κ\theta,\sigma,\kappa are the risk neutral VG parameters. rr θ\theta σ\sigma κ\kappa 0.06 -0.1 0.2 0.2

4.2 European options

We compare the numerical results for European call and put options obtained with the multinomial and the PIDE approaches.

  • VG PIDE: We solve the VG PIDE following the method proposed by [9]. The Lévy measure is singular in the origin and this is a problem for the computation of the integral term in (24). Fixing a truncation parameter ϵ>0\epsilon>0, we approximate the infinite activity martingale jump component with sizes smaller than ϵ\epsilon, with a Brownian motion with same variance. The resulting approximated PIDE has the “jump-diffusion-like” form:

    V(t,x)t+(r12σϵ2wϵ)V(t,x)x+12σϵ22V(t,x)x2\displaystyle\frac{\partial V(t,x)}{\partial t}+\bigl{(}r-\frac{1}{2}\sigma_{\epsilon}^{2}-w_{\epsilon}\bigr{)}\frac{\partial V(t,x)}{\partial x}+\frac{1}{2}\sigma_{\epsilon}^{2}\frac{\partial^{2}V(t,x)}{\partial x^{2}} (40)
    +|z|ϵV(t,x+z)ν(dz)=(λϵ+r)V(t,x).\displaystyle+\int_{|z|\geq\epsilon}V(t,x+z)\nu(dz)=(\lambda_{\epsilon}+r)V(t,x).

    where we introduced the parameters σϵ2=|z|<ϵz2ν(dz)\sigma_{\epsilon}^{2}=\int_{|z|<\epsilon}z^{2}\nu(dz), ωϵ=|z|ϵ(ez1)ν(dz)\omega_{\epsilon}=\int_{|z|\geq\epsilon}(e^{z}-1)\nu(dz) and λϵ=|z|ϵν(dz)\lambda_{\epsilon}=\int_{|z|\geq\epsilon}\nu(dz). More details are in [8]. We solve the PIDE (40) using the implicit-explicit finite difference scheme proposed in [9], and choosing the truncator parameter ϵ=1.5δx\epsilon=1.5\delta x, where δx\delta x is the size of the space step. It turns out that the solution of the discretized equation convergences very slowly to the option price, and therefore we required a grid with 1400014000 space steps and 70007000 time steps. The algorithm is written in Matlab and runs on an Intel i7 (7th Gen) with Linux. It takes about 30 minutes to complete.

  • Multinomial: We follow the algorithm proposed in the previous section. The number of time steps for all the computations is N=2000N=2000. In the table 4.2 we show a convergence table for the prices of European calls, puts and American puts. It is straightforward to see that the convergence is quite fast.

\tbl

Convergence table for ATM European and American options with strike K=40K=40 and T=1T=1. The time unit is in seconds. NN Eu. Call Eu. Put Time Am. Put Time 50 4.41873125 2.08928091 0.001 2.36765911 0.007 100 4.41960265 2.09015381 0.002 2.37255454 0.02 200 4.41997010 2.09052201 0.004 2.37480218 0.07 400 4.42013640 2.09068869 0.01 2.37587117 0.29 800 4.42021515 2.09076762 0.03 2.37639131 1.09 1000 4.42023054 2.09078306 0.04 2.37649417 1.67 1500 4.42025089 2.09080345 0.06 2.37663070 3.79 2000 4.42026098 2.09081357 0.10 2.37669869 6.80 2500 4.42026701 2.09081962 0.16 2.37673941 10.65 3000 4.42027102 2.09082364 0.2 2.37676652 14.78

Figures (2) and (3) show the prices obtained by the multinomial method compared with those obtained by PIDE. In table 4.2 we compare directly the call/put numerical values obtained with the two methods.

Refer to caption
Figure 2: European call option with strike K=40K=40 and time to maturity 1 year.
Refer to caption
Figure 3: European put option with strike K=40K=40 and time to maturity 1 year.

Pricing vanilla call and put European options is quite simple and the best approach is to use the closed formula derived in [18]. The big advantage of the multinomial method is in the computation of American options prices, where there is no closed formula and all the other approaches, such as PIDEs and Least Squares Monte Carlo, are difficult to implement and much slower.

\tbl

European Options, with strike K=40K=40 and T=1T=1. Different methods S0S_{0} PIDE Call Multi Call PIDE Put Multi Put 36 2.1036 2.1131 3.7842 3.7837 38 3.1163 3.1051 2.7893 2.7756 40 4.4162 4.4203 2.0852 2.0908 42 5.8335 5.8309 1.5050 1.5014 44 7.4417 7.4524 1.1132 1.1229

4.3 American options

In this section we present the numerical results obtained with the multinomial method algorithm for American put options, and compare them with the PIDE method (see fig. 4). The PIDE (40) is modified in order to take in account the early exercise feature:

min{V(t,x)t(r12σϵ2wϵ)V(t,x)x12σϵ22V(t,x)x2+(λϵ+r)V(t,x)\displaystyle\min\biggl{\{}-\frac{\partial V(t,x)}{\partial t}-\bigl{(}r-\frac{1}{2}\sigma_{\epsilon}^{2}-w_{\epsilon}\bigr{)}\frac{\partial V(t,x)}{\partial x}-\frac{1}{2}\sigma_{\epsilon}^{2}\frac{\partial^{2}V(t,x)}{\partial x^{2}}+(\lambda_{\epsilon}+r)V(t,x) (41)
|z|ϵV(t,x+z)ν(dz),(V(t,x)(Kex)+)}=0.\displaystyle-\int_{|z|\geq\epsilon}V(t,x+z)\nu(dz)\,,\,\biggl{(}V(t,x)-(K-e^{x})^{+}\biggr{)}\biggr{\}}=0.

To solve this equation we use the same settings used for the Eq. (40): an implicit-explicit finite difference scheme, with 14000 space steps and 7000 time steps. The algorithm takes about 33 minutes to run.

The numerical values of the prices obtained with the multinomial and PIDE methods are collected in Tab. 4.3. The run times for the multinomial algorithm are shown in the convergence table 4.2.

Refer to caption
Figure 4: American put option with strike K=40K=40 and time to maturity 1 year. Comparison of PIDE prices and multinomial prices.
\tbl

Values for European and American put options using Black-Scholes and Variance Gamma model. Strike K=40K=40 and T=1T=1. The BS volatility have same value of the VG volatility: σBS=(σ2+θ2κ)=0.2049\sigma^{BS}=(\sigma^{2}+\theta^{2}\kappa)=0.2049. Prices comparison S0S_{0} BS Eu. Put VG Eu. Put BS Am. Put VG Am. Put VG Am. PIDE Put 30 8.1316 8.0809 10 10 10 32 6.5292 6.4055 8 8 8 34 5.1169 4.9851 6.0894 6 6 36 3.9150 3.7837 4.5415 4.3173 4.3982 38 2.9263 2.7756 3.3264 3.2034 3.2195 40 2.1388 2.0908 2.3924 2.3767 2.3531 42 1.5322 1.5014 1.6911 1.6947 1.6849 44 1.0766 1.1229 1.1755 1.2267 1.2118 46 0.7433 0.7858 0.8043 0.8699 0.8650 48 0.5049 0.5787 0.5425 0.6310 0.6221 50 0.3384 0.4259 0.3612 0.4661 0.4480 52 0.2238 0.3015 0.2376 0.3242 0.3222 55 0.1178 0.1909 0.1243 0.2051 0.1990 60 0.0386 0.0880 0.0404 0.0942 0.0913

In Table 4.3, we consider also European and American put option prices calculated with the Black-Scholes (BS) models. The BS volatility is chosen equal to the VG volatility σBS=(σ2+θ2κ)\sigma^{BS}=(\sigma^{2}+\theta^{2}\kappa). As expected, the deep OTM (out of the money) prices computed under VG are higher than the corresponding prices computed under BS. This is a consequence of the shape of the VG density function (10), which has heavier tails than the normal distribution. This means that the probability of a deep OTM option to return in the money, is higher if calculated with the VG model than BS, and therefore we get higher option prices.

The Black-Scholes prices are computed using a binomial algorithm. For European options the prices converge to the BS closed formula prices. The same values can be obtained using the multinomial algorithm for the VG process and setting θ=κ=0\theta=\kappa=0 and σ=σBS\sigma=\sigma^{BS}. Recall that under the Black-Scholes model, the log-returns follow a Brownian motion. Looking at the definition of the VG process (9), it is evident that when θ\theta and κ\kappa are zero, the process becomes a Brownian motion:

XtVGθ,κ0σWt.X^{VG}_{t}\underset{\theta,\kappa\to 0}{\to}\sigma W_{t}.

As a consequence, the price process (21) converges to the Geometric Brownian Motion:

St=S0e(r+ω)t+Xtθ,κ0S0e(r12σ2)t+σWtS_{t}=S_{0}e^{(r+\omega)t+X_{t}}\underset{\theta,\kappa\to 0}{\to}S_{0}e^{(r-\frac{1}{2}\sigma^{2})t+\sigma W_{t}}

where:

limθ,κ0w\displaystyle\lim_{\theta,\kappa\to 0}w =limθ,κ01κlog(1θκ12σ2κ)\displaystyle=\lim_{\theta,\kappa\to 0}\frac{1}{\kappa}\log(1-\theta\kappa-\frac{1}{2}\sigma^{2}\kappa)
=12σ2.\displaystyle=-\frac{1}{2}\sigma^{2}.

5 Finite difference approximation

Consider the VG PIDE (24):

V(t,x)t+(r+ω)V(t,x)x+[V(t,x+y)V(t,x)]ν(dy)=rV(t,x).\frac{\partial V(t,x)}{\partial t}+(r+\omega)\frac{\partial V(t,x)}{\partial x}+\int_{\mathbb{R}}\bigl{[}V(t,x+y)-V(t,x)\bigr{]}\nu(dy)=rV(t,x). (42)

We can expand V(t,x+y)V(t,x+y) using the Taylor formula up to the fourth order:

V(t,x+y)\displaystyle V(t,x+y) =V(t,x)+V(t,x)xy+122V(t,x)x2y2\displaystyle=V(t,x)+\frac{\partial V(t,x)}{\partial x}y+\frac{1}{2}\frac{\partial^{2}V(t,x)}{\partial x^{2}}y^{2} (43)
+163V(t,x)x3y3+1244V(t,x)x4y4\displaystyle+\frac{1}{6}\frac{\partial^{3}V(t,x)}{\partial x^{3}}y^{3}+\frac{1}{24}\frac{\partial^{4}V(t,x)}{\partial x^{4}}y^{4}

and use the expression for the cumulants (see Appendix A). We denote with c~n\tilde{c}_{n} the cumulant evaluated at t=1:t=1:

c~n=ynν(dy).\tilde{c}_{n}=\int_{\mathbb{R}}y^{n}\nu(dy). (44)

The approximated equation is a fourth order PDE:

V(t,x)t+(r+ω+c~1)V(t,x)x+12c~22V(t,x)x2\displaystyle\frac{\partial V(t,x)}{\partial t}+(r+\omega+\tilde{c}_{1})\frac{\partial V(t,x)}{\partial x}+\frac{1}{2}\tilde{c}_{2}\frac{\partial^{2}V(t,x)}{\partial x^{2}} (45)
+16c~33V(t,x)x3+124c~44V(t,x)x4=rV(t,x).\displaystyle+\frac{1}{6}\tilde{c}_{3}\frac{\partial^{3}V(t,x)}{\partial x^{3}}+\frac{1}{24}\tilde{c}_{4}\frac{\partial^{4}V(t,x)}{\partial x^{4}}=rV(t,x).

Consider the variable xx in the interval [xmin,xmax][x_{min},x_{max}] and discretize time and space, such that h=Δx=xmaxxminNh=\Delta x=\frac{x_{max}-x_{min}}{N} and Δt=Tt0M\Delta t=\frac{T-t_{0}}{M} for N,MN,M\in\mathbb{N}. Using the variables xi=xmin+ihx_{i}=x_{min}+ih for i=0,,Ni=0,...,N and tn=t0+nΔtt_{n}=t_{0}+n\Delta t for n=0,,Mn=0,...,M, we use the short notation

V(tn,xi)=Vin.V(t_{n},x_{i})=V^{n}_{i}.

We can use the following discretization for the time derivative, corresponding to an explicit method:

V(t,x)tVin+1VinΔt,\frac{\partial V(t,x)}{\partial t}\approx\frac{V^{n+1}_{i}-V^{n}_{i}}{\Delta t}, (46)

and the central difference for the spatial derivative:

V(t,x)x\displaystyle\frac{\partial V(t,x)}{\partial x}\approx Vi+hn+1Vihn+12h,\displaystyle\;\frac{V^{n+1}_{i+h}-V^{n+1}_{i-h}}{2h}, (47)
2V(t,x)x2\displaystyle\frac{\partial^{2}V(t,x)}{\partial x^{2}}\approx Vi+hn+1+Vihn+12Vin+1h2,\displaystyle\;\frac{V^{n+1}_{i+h}+V^{n+1}_{i-h}-2V^{n+1}_{i}}{h^{2}},
3V(t,x)x3\displaystyle\frac{\partial^{3}V(t,x)}{\partial x^{3}}\approx Vi+2hn+1Vi2hn+1+2Vihn+12Vi+hn+12h3,\displaystyle\;\frac{V^{n+1}_{i+2h}-V^{n+1}_{i-2h}+2V^{n+1}_{i-h}-2V^{n+1}_{i+h}}{2h^{3}},
4V(t,x)x4\displaystyle\frac{\partial^{4}V(t,x)}{\partial x^{4}}\approx Vi2hn+1+Vi+2hn+14Vihn+14Vi+hn+1+6Vin+1h4.\displaystyle\;\frac{V^{n+1}_{i-2h}+V^{n+1}_{i+2h}-4V^{n+1}_{i-h}-4V^{n+1}_{i+h}+6V^{n+1}_{i}}{h^{4}}.

The discretized equation is:

(Vin+1VinΔt)+(r+ω+c~1)(Vi+hn+1Vihn+12h)\displaystyle\biggl{(}\frac{V^{n+1}_{i}-V^{n}_{i}}{\Delta t}\biggr{)}+(r+\omega+\tilde{c}_{1})\biggl{(}\frac{V^{n+1}_{i+h}-V^{n+1}_{i-h}}{2h}\biggr{)} (48)
+12c~2(Vi+hn+1+Vihn+12Vin+1h2)+16c~3(Vi+2hn+1Vi2hn+1+2Vihn+12Vi+hn+12h3)\displaystyle+\frac{1}{2}\tilde{c}_{2}\biggl{(}\frac{V^{n+1}_{i+h}+V^{n+1}_{i-h}-2V^{n+1}_{i}}{h^{2}}\biggr{)}+\frac{1}{6}\tilde{c}_{3}\biggl{(}\frac{V^{n+1}_{i+2h}-V^{n+1}_{i-2h}+2V^{n+1}_{i-h}-2V^{n+1}_{i+h}}{2h^{3}}\biggr{)}
+124c~4(Vi2hn+1+Vi+2hn+14Vihn+14Vi+hn+1+6Vin+1h4)=rVin.\displaystyle+\frac{1}{24}\tilde{c}_{4}\biggl{(}\frac{V^{n+1}_{i-2h}+V^{n+1}_{i+2h}-4V^{n+1}_{i-h}-4V^{n+1}_{i+h}+6V^{n+1}_{i}}{h^{4}}\biggr{)}=rV^{n}_{i}.

Rearranging the terms we obtain:

(1+rΔt)Vin=\displaystyle(1+r\Delta t)V^{n}_{i}= Vi+hn+1[(r+ω+c~1)Δt2h+c~2Δt2h2c~3Δt6h3c~4Δt6h4]\displaystyle V^{n+1}_{i+h}\biggl{[}\frac{(r+\omega+\tilde{c}_{1})\Delta t}{2h}+\frac{\tilde{c}_{2}\Delta t}{2h^{2}}-\frac{\tilde{c}_{3}\Delta t}{6h^{3}}-\frac{\tilde{c}_{4}\Delta t}{6h^{4}}\biggr{]} (49)
+\displaystyle+ Vihn+1[(r+ω+c~1)Δt2h+c~2Δt2h2+c~3Δt6h3c~4Δt6h4]\displaystyle V^{n+1}_{i-h}\biggl{[}\frac{-(r+\omega+\tilde{c}_{1})\Delta t}{2h}+\frac{\tilde{c}_{2}\Delta t}{2h^{2}}+\frac{\tilde{c}_{3}\Delta t}{6h^{3}}-\frac{\tilde{c}_{4}\Delta t}{6h^{4}}\biggr{]}
+\displaystyle+ Vi+2hn+1[c~3Δt12h3+c~4Δt24h4]\displaystyle V^{n+1}_{i+2h}\biggl{[}\frac{\tilde{c}_{3}\Delta t}{12h^{3}}+\frac{\tilde{c}_{4}\Delta t}{24h^{4}}\biggr{]}
+\displaystyle+ Vi2hn+1[c~3Δt12h3+c~4Δt24h4]\displaystyle V^{n+1}_{i-2h}\biggl{[}-\frac{\tilde{c}_{3}\Delta t}{12h^{3}}+\frac{\tilde{c}_{4}\Delta t}{24h^{4}}\biggr{]}
+\displaystyle+ Vin+1[1c~2Δth2+c~4Δt4h4].\displaystyle V^{n+1}_{i}\biggl{[}1-\frac{\tilde{c}_{2}\Delta t}{h^{2}}+\frac{\tilde{c}_{4}\Delta t}{4h^{4}}\biggr{]}.

If we rename the coefficients, the equation is:

(1+rΔt)Vin=Vi+hn+1p+h+Vihn+1ph+Vi+2hn+1p+2h+Vi2hn+1p2h+Vin+1p0.(1+r\Delta t)V^{n}_{i}=V^{n+1}_{i+h}p_{+h}+V^{n+1}_{i-h}p_{-h}+V^{n+1}_{i+2h}p_{+2h}+V^{n+1}_{i-2h}p_{-2h}+V^{n+1}_{i}p_{0}. (50)

The coefficients can be interpreted as the (risk neutral) transition probabilities for the Markov chain:

X(tn+1)={X(tn)+2hwith (xixi+2h)=p+2hX(tn)+hwith (xixi+h)=p+hX(tn)with (xixi)=p0X(tn)hwith (xixih)=phX(tn)+2hwith (xixi2h)=p2hX(t_{n+1})=\begin{dcases}X(t_{n})+2h&\mbox{with }\mathbb{P}(x_{i}\to x_{i}+2h)=p_{+2h}\\ X(t_{n})+h&\mbox{with }\mathbb{P}(x_{i}\to x_{i}+h)=p_{+h}\\ X(t_{n})&\mbox{with }\mathbb{P}(x_{i}\to x_{i})=p_{0}\\ X(t_{n})-h&\mbox{with }\mathbb{P}(x_{i}\to x_{i}-h)=p_{-h}\\ X(t_{n})+2h&\mbox{with }\mathbb{P}(x_{i}\to x_{i}-2h)=p_{-2h}\end{dcases}

It is straightforward to verify that p2h+ph+p0+p+h+p+2h=1p_{-2h}+p_{-h}+p_{0}+p_{+h}+p_{+2h}=1. The space step hh has to to be chosen in order to satisfy the positivity condition of the transition probabilities, pjh>0p_{jh}>0 for j=2,1,0,1,2j=-2,-1,0,1,2. The value of the option in the previous time step is thus the discounted expectation under the risk neutral probability measure \mathbb{Q}:

Vin=11+rΔt𝔼[Vn+1(X(tn+1))|X(tn)=xi].V^{n}_{i}=\frac{1}{1+r\Delta t}\mathbb{E}^{\mathbb{Q}}\biggl{[}V^{n+1}(X(t_{n+1}))\bigg{|}X(t_{n})=x_{i}\biggr{]}. (51)

Define the increments ΔX=X(tn+1)X(tn)\Delta X=X(t_{n+1})-X(t_{n}). We check that the local properties for the moments of the Markov chain are satisfied:

μ=\displaystyle\mu^{\prime}= 𝔼[ΔX]=(r+ω+c~1)Δt\displaystyle\;\mathbb{E}[\Delta X]=\bigl{(}r+\omega+\tilde{c}_{1}\bigr{)}\Delta t (52)
μ2=\displaystyle\mu^{\prime}_{2}= 𝔼[ΔX2]=c~2Δt\displaystyle\,\mathbb{E}[\Delta X^{2}]=\tilde{c}_{2}\Delta t (53)
μ3=\displaystyle\mu^{\prime}_{3}= 𝔼[ΔX3]=((r+ω+c~1)h2+c~3)Δt\displaystyle\,\mathbb{E}[\Delta X^{3}]=\bigl{(}(r+\omega+\tilde{c}_{1})h^{2}+\tilde{c}_{3}\bigr{)}\Delta t (54)
μ4=\displaystyle\mu^{\prime}_{4}= 𝔼[ΔX4]=(c~2h2+c~4)Δt.\displaystyle\,\mathbb{E}[\Delta X^{4}]=\bigl{(}\tilde{c}_{2}h^{2}+\tilde{c}_{4}\bigr{)}\Delta t. (55)

At first order in Δt\Delta t we can calculate the variance, skewness and kurtosis777Remind that Skew[X]=μ3μ23/2\mbox{Skew}[X]=\frac{\mu_{3}}{\mu_{2}^{3/2}} and Kurt[X]=μ4μ22\mbox{Kurt}[X]=\frac{\mu_{4}}{\mu_{2}^{2}}, with μi\mu_{i} the central i-th moment. Remind also that μ3=μ33μμ2+2μ3\mu_{3}=\mu^{\prime}_{3}-3\mu^{\prime}\mu^{\prime}_{2}+2\mu^{\prime 3} and μ4=μ44μμ3+6μ2μ23μ4\mu_{4}=\mu^{\prime}_{4}-4\mu^{\prime}\mu^{\prime}_{3}+6\mu^{\prime 2}\mu^{\prime}_{2}-3\mu^{\prime 4} :

Var[ΔX]\displaystyle\mbox{Var}[\Delta X] c~2Δt\displaystyle\approx\tilde{c}_{2}\Delta t (56)
Skew[ΔX]\displaystyle\mbox{Skew}[\Delta X] (r+ω+c~1)(c~2)3/2hΔt+c~3(c~2)3/21Δt\displaystyle\approx\frac{(r+\omega+\tilde{c}_{1})}{(\tilde{c}_{2})^{3/2}}\frac{h}{\sqrt{\Delta t}}+\frac{\tilde{c}_{3}}{(\tilde{c}_{2})^{3/2}}\frac{1}{\sqrt{\Delta t}} (57)
Kurt[ΔX]\displaystyle\mbox{Kurt}[\Delta X] h2c~21Δt+c~4(c~2)21Δt.\displaystyle\approx\frac{h^{2}}{\tilde{c}_{2}}\frac{1}{\Delta t}+\frac{\tilde{c}_{4}}{(\tilde{c}_{2})^{2}}\frac{1}{\Delta t}. (58)

For h0h\to 0, we confirm that the local variance, skewness and kurtosis are consistent with their definition in terms of cumulants.

We expect that the transition probabilities in (34) obtained by moment matching, can be recovered from the probabilities in (50) obtained by finite difference discretization, for a particular choice of the space step hh. We have not solved this issue yet, and we think it can be a topic for further research.

6 Conclusions

This article proposes a method to price options using a multinomial method when the underlying price is modeled with a Variance Gamma process. The multinomial method is well known in the literature, see for example [8], [16] ,[25], [26] and [27], but in this work we focus the analysis only on the VG process and compare our numerical results with other different methods.

The VG process is approximated by a general jump process that has the same first four cumulants of the original VG process. We proved that the multinomial method converges to this approximated process. We obtained numerical results for European and American options, and compared them with PIDE methods and with results computed within the Black Scholes framework. It turns out that the multinomial method is easier to implement than the finite differences method. The algorithm does not involve any matrix multiplication or matrix inversion as in the case of implicit/explicit method for PIDEs. This means that the computational time is much smaller.

We proposed a topic of further investigation in Section 5. The probabilities obtained by discretizing the approximated PDE are related with the probabilities obtained by moment matching for a particular choice of the space step parameter. Another possible topic of further research is the comparison of our results for American options with other numerical methods such as the Least Square Monte Carlo ([17]).

Acknowledgements

Our sincere thanks are for the Department of Mathematics of ISEG and CEMAPRE, University of Lisbon, http://cemapre.iseg.ulisboa.pt/. This research was supported by the European Union in the FP7-PEOPLE-2012-ITN project STRIKE - Novel Methods in Computational Finance (304617), and by CEMAPRE MULTI/00491, financed by FCT/MEC through Portuguese national funds. We wish also to acknowledge all the members of the STRIKE network, http://www.itn-strike.eu/.

Appendix A Poisson integration

A convenient tool to analyze the jumps of a Lévy process is the random measure of jumps. Within this formalism it is possible to describe jump processes with infinite activity, as the VG process. The jump process associated to the Lévy process XtX_{t} is defined, for each 0tT0\leq t\leq T , by:

ΔXt=XtXt\Delta X_{t}=X_{t}-X_{t-} (59)

where Xt=limstXsX_{t-}=\lim_{s\uparrow t}X_{s}. Consider the set A(\{0})A\in\mathcal{B}(\mathbb{R}\backslash\{0\}) , the random measure of the jumps of XtX_{t} is defined by:

N(t,A)(ω)\displaystyle N(t,A)(\omega) =#{ΔXs(ω)A: 0st}\displaystyle=\#\{\Delta X_{s}(\omega)\in A\;:\;0\leq s\leq t\} (60)
=st1A(ΔXs(ω)).\displaystyle=\sum_{s\leq t}1_{A}(\Delta X_{s}(\omega)).

This measure counts the number of jumps of size in AA, up to time tt. We say that A(\{0})A\in\mathcal{B}(\mathbb{R}\backslash\{0\}) is bounded below if 0A¯0\not\in\bar{A} (zero does not belong to the closure of AA). If AA is bounded below, then N(t,A)<N(t,A)<\infty and is a Poisson process with intensity

ν(A)=𝔼[N(1,A)],\nu(A)=\mathbb{E}[N(1,A)], (61)

(see [4] theorem 2.3.4 and 2.3.5). If AA is not bounded below, it is possible to have ν(A)=\nu(A)=\infty and N(t,A)N(t,A) is not a Poisson process because of the accumulation of infinite numbers of small jumps. The process N(t,A)N(t,A) is called Poisson random measure. The Lévy measure corresponds to the intensity of the Poisson measure. The Compensated Poisson random measure is defined by

N~(t,A)=N(t,A)tν(A),\tilde{N}(t,A)=N(t,A)-t\nu(A), (62)

which is a martingale.

The next step is to define the integration with respect to a random measure. Following [4], let f:f:\mathbb{R}\to\mathbb{R} be a Borel-measurable function. For any AA bounded below, we define the Poisson integral of ff as:

Af(x)N(t,dx)(ω)=xAf(x)N(t,{x})(ω).\int_{A}f(x)N(t,dx)(\omega)=\sum_{x\in A}f(x)N(t,\{x\})(\omega). (63)

For the case of integration of the identity function, we see that every compound Poisson process can be represented by:

Xt=s[0,t]ΔXs=0txN(dt,dx)=xN(t,dx).X_{t}=\sum_{s\in[0,t]}\Delta X_{s}=\int_{0}^{t}\int_{\mathbb{R}}xN(dt,dx)=\int_{\mathbb{R}}xN(t,dx). (64)

We can also define in the same way the compensated Poisson integral with respect the compensated Poisson measure. We can further define:

|x|<1xN~(t,dx)=limϵ0ϵ<|x|<1xN~(t,dx),\int_{|x|<1}x\tilde{N}(t,dx)=\lim_{\epsilon\to 0}\int_{\epsilon<|x|<1}x\tilde{N}(t,dx), (65)

that represent the compensated sum of small jumps.

We present a last formula for computing the moments of a general compound Poisson process. Let f:f:\mathbb{R}\to\mathbb{R} be a measurable function such that A|f(x)|ν(dx)<\int_{A}|f(x)|\nu(dx)<\infty, and Xt=Af(x)N(t,dx)X_{t}=\int_{A}f(x)N(t,dx), the characteristic function of XtX_{t} is:

𝔼[eiuXt]\displaystyle\mathbb{E}[e^{iuX_{t}}] =𝔼[exp(iuAf(x)N(t,dx)))]\displaystyle=\mathbb{E}\left[\exp\left(iu\int_{A}f(x)N(t,dx))\right)\right] (66)
=exp(t[eiuf(x)1]ν(Af1(dx))).\displaystyle=\exp\left(t\int_{\mathbb{R}}\bigl{[}e^{iuf(x)}-1\bigr{]}\;\nu\bigl{(}A\cap f^{-1}(dx)\bigr{)}\right).

Assuming that 𝔼[Xtn]<\mathbb{E}[X_{t}^{n}]<\infty, all the moments can be computed from (66) by differentiation using eq:

𝔼[Xtn]=1innϕXt(u)un|u=0,n.\mathbb{E}[X_{t}^{n}]=\frac{1}{i^{n}}\frac{\partial^{n}\phi_{X_{t}}(u)}{\partial u^{n}}\biggr{|}_{u=0},\quad\forall n\in\mathbb{N}. (67)

For the case of ff identity function, A=A=\mathbb{R}, and ν\nu satisfying the integrability conditions, using (70) we derive the expression for the cumulants:

cn=txnν(dx).c_{n}=t\int_{\mathbb{R}}x^{n}\nu(dx). (68)

The cumulants of XtX_{t} are thus the moments of its Lévy measure.

Appendix B Cumulants

The cumulant generating function HXt(u)H_{X_{t}}(u) of XtX_{t} is defined as the natural logarithm of its characteristic function (see [8]). Using the Lévy-Khintchine representation for the characteristic function (1), it is easy to find its relation with the Lévy symbol:

HXt(u)\displaystyle H_{X_{t}}(u) =log(ϕXt(u))\displaystyle=\log(\phi_{X_{t}}(u)) (69)
=tη(u)\displaystyle=t\eta(u)
=n=1cn(iu)nn!\displaystyle=\sum_{n=1}^{\infty}c_{n}\frac{(iu)^{n}}{n!}

The cumulants of a Lévy process are thus defined by:

cn=tinnη(u)un|u=0.c_{n}=\frac{t}{i^{n}}\frac{\partial^{n}\eta(u)}{\partial u^{n}}\biggr{|}_{u=0}. (70)

The cumulants are closely related to the central moments μn\mu_{n}:

μ0=1,μ1=0,μn=k=1n(n1k1)ckμnkfor n>1.\mu_{0}=1,\hskip 10.00002pt\mu_{1}=0,\hskip 10.00002pt\mu_{n}=\sum_{k=1}^{n}\binom{n-1}{k-1}c_{k}\mu_{n-k}\hskip 10.00002pt\mbox{for }n>1. (71)

For a Poisson process with finite firsts nn moments, all the information about the cumulants is contained inside the Lévy measure. Expand in Taylor series the exponential

eiux1+iuxu2x22iu3x33!+u4x44!+e^{iux}\approx 1+iux-\frac{u^{2}x^{2}}{2}-\frac{iu^{3}x^{3}}{3!}+\frac{u^{4}x^{4}}{4!}+\dots

The Lévy symbol from the representation (7) becomes:

tη(u)\displaystyle t\eta(u) =ibut+t(eiux1)ν(dx)\displaystyle=ib^{\prime}ut+t\int_{\mathbb{R}}(e^{iux}-1)\nu(dx) (72)
=i(b|x|<1xν(dx))ut+iutxν(dx)u22tx2ν(dx)\displaystyle=i\biggl{(}b-\int_{|x|<1}x\nu(dx)\biggr{)}ut+iut\int_{\mathbb{R}}x\nu(dx)-\frac{u^{2}}{2}t\int_{\mathbb{R}}x^{2}\nu(dx)
iu33!tx3ν(dx)+u44!tx4ν(dx)+\displaystyle\hskip 20.00003pt-\frac{iu^{3}}{3!}t\int_{\mathbb{R}}x^{3}\nu(dx)+\frac{u^{4}}{4!}t\int_{\mathbb{R}}x^{4}\nu(dx)+\dots
=ic1uc2u22ic3u33!+c4u44!+\displaystyle=ic_{1}u-\frac{c_{2}u^{2}}{2}-\frac{ic_{3}u^{3}}{3!}+\frac{c_{4}u^{4}}{4!}+\dots

with c1=t(b+|x|1xν(dx))c_{1}=t\bigl{(}b+\int_{|x|\geq 1}x\nu(dx)\bigr{)}.

References

  • Ait-Sahalia and Jacod, [2012] Ait-Sahalia, Y. and Jacod, J. (2012). Analyzing the spectrum of asset returns: Jump and volatility components in high frequency data. Journal of Economic literature, 50(4):1007–1050.
  • Almendral, [2005] Almendral, A. (2005). Numerical valuation of american options under the CGMY process. Eds., Exotic Option Pricing and Advanced Levy Models, Wiley, Hoboken.
  • Almendral and Oosterlee, [2007] Almendral, A. and Oosterlee, C. W. (2007). On American options under the Variance Gamma process. Applied Mathematical Finance, 14(2):131–152.
  • Applebaum, [2009] Applebaum, D. (2009). Lévy Processes and Stochastic Calculus. Cambridge University Press; 2nd edition.
  • Barndorff-Nielsen, [1998] Barndorff-Nielsen (1998). Processes of Normal inverse Gaussian type. Finance and Stochastics, 2:41–68.
  • Black and Scholes, [1973] Black, F. and Scholes, M. (1973). The pricing of options and corporate liabilities. The Journal of Political Economy, 81(3):637–654.
  • Carr and Madan, [1998] Carr, P. and Madan, D. (1998). Option valuation using the Fast Fourier transform. Journal of Computational Finance, 2:61–73.
  • Cont and Tankov, [2003] Cont, R. and Tankov, P. (2003). Financial Modelling with Jump Processes. Chapman and Hall/CRC; 1 edition.
  • Cont and Voltchkova, [2005] Cont, R. and Voltchkova, E. (2005). A finite difference scheme for option pricing in jump diffusion and exponential Lévy models. SIAM Journal of numerical analysis, 43(4):1596–1626.
  • Cox et al., [1979] Cox, J., Ross, S., and Rubinstein, M. (1979). Option pricing: A simplified approach. Journal of financial economics, 7:229–263.
  • Eberlein and Keller, [1995] Eberlein, E. and Keller, U. (1995). Hyperbolic distributions in finance. Bernoulli, 1(3):281–299.
  • Fu, [2000] Fu, M. C. (2000). Variance-Gamma and Monte Carlo. Advances in Mathematical Finance., pages 21–34.
  • Geman et al., [1998] Geman, H., Madan, D., and Yor, M. (1998). Asset prices are Brownian motion: only in business time. Quantitative Analysis in Financial Markets: Collected Papers of the New York University Mathematical Finance Seminar, 2(1):103–146.
  • Hainaut and MacGilchrist, [2010] Hainaut, D. and MacGilchrist, R. (Winter 2010). An interest tree driven by a lévy process. The Journal of Derivatives, 18(2):33–45.
  • Hirsa and Madan, [2001] Hirsa, A. and Madan, D. (2001). Pricing American options under Variance Gamma. Journal of Computational Finance, 7.
  • Kellezi and Webber, [2006] Kellezi, E. and Webber, N. (2006). Valuing Bermudan options when asset returns are Lévy processes. Quantitative Finance, 4(1):87–100.
  • Longstaff and Schwartz, [2001] Longstaff, F. A. and Schwartz, E. S. (2001). Valuing American options by simulation: A simple Least-Squares approach. Review of Financial Studies, pages 113–147.
  • Madan et al., [1998] Madan, D., Carr, P., and Chang, E. (1998). The Variance Gamma process and option pricing. European Finance Review, 2:79–105.
  • Madan and Milne, [1991] Madan, D. and Milne, F. (1991). Option pricing with V.G. martingale components. Mathematical Finance, 1:39–55.
  • Madan and Seneta, [1990] Madan, D. and Seneta, E. (1990). The Variance Gamma (V.G.) model for share market returns. The journal of Business, 63(4):511–524.
  • Maller et al., [2006] Maller, R., Solomon, D., and Szimayer, A. (2006). A multinomial approximation for american option prices in levy process models. Mathematical Finance, 16(4):613–633.
  • Sato, [1999] Sato, K. I. (1999). Lévy processes and infinitely divisible distributions. Cambridge University Press.
  • Seneta, [2004] Seneta, E. (2004). Fitting the Variance-Gamma model to financial data. Journal of Applied Probability, 41:177–187.
  • Ssebugenyi and Konlack, [2013] Ssebugenyi, C.S. Mwaniki, I. and Konlack, V. (2013). On the minimal entropy martingale measure and multinomial lattices with cumulants. Applied Mathematical Finance, 20(4):359–379.
  • Yamada and Primbs, [2001] Yamada, Y. and Primbs, J. (2001). Construction of multinomial lattice random walks for optimal hedges. Proc. of the 2001 international conference of Computational Science, pages 579–588.
  • Yamada and Primbs, [2003] Yamada, Y. and Primbs, J. (2003). Mean square optimal hedges using higher order moments. Proc of the 2003 international conference on Computational Intelligence for Financial Engineering.
  • Yamada and Primbs, [2004] Yamada, Y. and Primbs, J. (2004). Properties of multinomial lattices with cumulants for option pricing and hedging. Asia-Pacific Financial Markets, 11:335–365.