A New Computational Scheme for Computing Greeks by the Asymptotic Expansion Approach

We developed a new scheme for computing “Greeks” of derivatives by an asymptotic expansion approach. In particular, we derived analytical approximation formulae for Deltas and Vegas of plain vanilla and average European call options under general Markovian processes of underlying asset prices. Moreover, we introduced a new variance reduction method of Monte Carlo simulations based on the asymptotic expansion scheme. Finally, several numerical examples under CEV processes confirmed the validity of our method.     

Pricing exotic options using MSL-MC

Today, better numerical approximations are required for multi-dimensional SDEs to improve on the poor performance of the standard Monte Carlo pricing method. With this aim in mind, this paper presents a method (MSL-MC) to price exotic options using multi-dimensional SDEs (e.g. stochastic volatility models). Usually, it is the weak convergence property of numerical discretizations that is most important, because, in financial applications, one is mostly concerned with the accurate estimation of expected payoffs. However, in the recently developed Multilevel Monte Carlo path simulation method (ML-MC), the strong convergence property plays a crucial role. We present a modification to the ML-MC algorithm that can be used to achieve better savings. To illustrate these, various examples of exotic options are given using a wide variety of payoffs, stochastic volatility models and the new Multischeme Multilevel Monte Carlo method (MSL-MC). For standard payoffs, both European and Digital options are presented. Examples are also given for complex payoffs, such as combinations of European options (Butterfly Spread, Strip and Strap options). Finally, for path-dependent payoffs, both Asian and Variance Swap options are demonstrated. This research shows how the use of stochastic volatility models and the θ scheme can improve the convergence of the MSL-MC so that the computational cost to achieve an accuracy of O(ε) is reduced from O(ε^?3) to O(ε^?2) for a payoff under global and non-global Lipschitz conditions.     

General closed-form basket option pricing bounds

This article presents lower and upper bounds on the prices of basket options for a general class of continuous-time financial models. The techniques we propose are applicable whenever the joint characteristic function of the vector of log-returns is known. Moreover, the basket value is not required to be positive. We test our new price approximations on different multivariate models, allowing for jumps and stochastic volatility. Numerical examples are discussed and benchmarked against Monte Carlo simulations. All bounds are general and do not require any additional assumption on the characteristic function, so our methods may be employed also to non-affine models. All bounds involve the computation of one-dimensional Fourier transforms; hence, they do not suffer from the curse of dimensionality and can be applied also to high-dimensional problems where most existing methods fail. In particular, we study two kinds of price approximations: an accurate lower bound based on an approximating set and a fast bounded approximation based on the arithmetic-geometric mean inequality. We also show how to improve Monte Carlo accuracy by using one of our bounds as a control variate.     

Primal–dual quasi-Monte Carlo simulation with dimension reduction for pricing American options

The pricing of American options is one of the most challenging problems in financial engineering due to the involved optimal stopping time problem, which can be solved by using dynamic programming (DP). But applying DP is not always practical, especially when the state space is high dimensional. However, the curse of dimensionality can be overcome by Monte Carlo (MC) simulation. We can get lower and upper bounds by MC to ensure that the true price falls into a valid confidence interval. During the recent decades, progress has been made in using MC simulation to obtain both the lower bound by least-squares Monte Carlo method (LSM) and the upper bound by duality approach. However, there are few works on pricing American options using quasi-Monte Carlo (QMC) methods, especially to compute the upper bound. For comparing the sample variances and standard errors in the numerical experiments, randomized QMC (RQMC) methods are usually used. In this paper, we propose to use RQMC to replace MC simulation to compute both the lower bound (by the LSM) and the upper bound (by the duality approach). Moreover, we propose to use dimension reduction techniques, such as the Brownian bridge, principal component analysis, linear transformation and the gradients based principle component analysis. We perform numerical experiments on American–Asian options and American max-call options under the Black–Scholes model and the variance gamma model, in which the options have the path-dependent feature or are written on multiple underlying assets. We find that RQMC in combination with dimension reduction techniques can significantly increase the efficiency in computing both the lower and upper bounds, resulting in better estimates and tighter confidence intervals of the true price than pure MC simulation.     

How much is the gap?—Efficient jump risk-adjusted valuation of leveraged certificates

This paper develops a novel and highly efficient numerical algorithm for the gap risk-adjusted valuation of leveraged certificates. The existing literature relies on Monte Carlo simulations, which are not fast enough to be used in a market-making environment. This is because issuers need to compute thousands of price updates per second. By valuing leveraged certificates as multi-window barrier options, we explicitly model random jumps that occur at known times, such as between the exchange closing and re-opening. Our algorithm combines the one-day transition probability with Simpson’s numerical integration rule. This yields a backward induction scheme which requires a significantly coarser spatial and time grid than finite-difference methods. We confirm its robustness and accuracy through Monte Carlo simulations.     

Monte Carlo Option Pricing for Tempered Stable (CGMY) Processes

Lévy processes are popular models for stock price behavior since they allow to take into account jump risk and reproduce the implied volatility smile. In this paper, we focus on the tempered stable (also known as CGMY) processes, which form a flexible 6-parameter family of Lévy processes with infinite jump intensity. It is shown that under an appropriate equivalent probability measure a tempered stable process becomes a stable process whose increments can be simulated exactly. This provides a fast Monte Carlo algorithm for computing the expectation of any functional of tempered stable process. We use our method to price European options and compare the results to a recent approximate simulation method for tempered stable process by Madan and Yor (CGMY and Meixner Subordinators are absolutely continuous with respect to one sided stable subordinators, 2005).     

Fast estimation of true bounds on Bermudan option prices under jump-diffusion processes

Fast pricing of American-style options has been a difficult problem since it was first introduced to the financial markets in 1970s, especially when the underlying stocks’ prices follow some jump-diffusion processes. In this paper, we extend the ‘true martingale algorithm’ proposed by Belomestny et al. [Math. Finance, 2009, 19, 53–71] for the pure-diffusion models to the jump-diffusion models, to fast compute true tight upper bounds on the Bermudan option price in a non-nested simulation manner. By exploiting the martingale representation theorem on the optimal dual martingale driven by jump-diffusion processes, we are able to explore the unique structure of the optimal dual martingale and construct an approximation that preserves the martingale property. The resulting upper bound estimator avoids the nested Monte Carlo simulation suffered by the original primal–dual algorithm, therefore significantly improving the computational efficiency. Theoretical analysis is provided to guarantee the quality of the martingale approximation. Numerical experiments are conducted to verify the efficiency of our algorithm.     

Smoothing the payoff for efficient computation of Basket option prices

We consider the problem of pricing basket options in a multivariate Black–Scholes or Variance-Gamma model. From a numerical point of view, pricing such options corresponds to moderate and high-dimensional numerical integration problems with non-smooth integrands. Due to this lack of regularity, higher order numerical integration techniques may not be directly available, requiring the use of methods like Monte Carlo specifically designed to work for non-regular problems. We propose to use the inherent smoothing property of the density of the underlying in the above models to mollify the payoff function by means of an exact conditional expectation. The resulting conditional expectation is unbiased and yields a smooth integrand, which is amenable to the efficient use of adaptive sparse-grid cubature. Numerical examples indicate that the high-order method may perform orders of magnitude faster than Monte Carlo or Quasi Monte Carlo methods in dimensions up to 35.     

Calibration and advanced simulation schemes for the Wishart stochastic volatility model

In this article, we deal with calibration and Monte Carlo simulation of the Wishart stochastic volatility model. Despite the analytical tractability of the considered model, being of affine type, the implementation of Wishart-based stochastic volatility models poses non-trivial challenges from a numerical point of view. The goal of this article is to overcome these problems providing efficient numerical schemes for Monte Carlo simulations. Moreover, a fast and accurate calibration procedure is proposed.     

Analysing multi-level Monte Carlo for options with non-globally Lipschitz payoff

Giles (Oper. Res. 56:607–617, 2008) introduced a multi-level Monte Carlo method for approximating the expected value of a function of a stochastic differential equation solution. A key application is to compute the expected payoff of a financial option. This new method improves on the computational complexity of standard Monte Carlo. Giles analysed globally Lipschitz payoffs, but also found good performance in practice for non-globally Lipschitz cases. In this work, we show that the multi-level Monte Carlo method can be rigorously justified for non-globally Lipschitz payoffs. In particular, we consider digital, lookback and barrier options. This requires non-standard strong convergence analysis of the Euler–Maruyama method.      

A PDE method for estimation of implied volatility

In this paper it is proved that the Black–Scholes implied volatility satisfies a second order non-linear partial differential equation. The obtained PDE is then used to construct an algorithm for fast and accurate polynomial approximation for Black–Scholes implied volatility that improves on the existing numerical schemes from literature, both in speed and parallelizability. We also show that the method is applicable to other problems, such as approximation of implied Bachelier volatility.     

Option pricing for GARCH-type models with generalized hyperbolic innovations

In this paper, we provide a new dynamic asset pricing model for plain vanilla options and we discuss its ability to produce minimum mispricing errors on equity option books. Given the historical measure, the dynamics of assets being modeled by Garch-type models with generalized hyperbolic innovations and the pricing kernel is an exponential affine function of the state variables, we show that the risk-neutral distribution is unique and again implies a generalized hyperbolic dynamics with changed parameters. We provide an empirical test for our pricing methodology on two data sets of options, respectively written on the French CAC 40 and the American SP 500. Then, using our theoretical result associated with Monte Carlo simulations, we compare this approach with natural competitors in order to test its efficiency. More generally, our empirical investigations analyse the ability of specific parametric innovations to reproduce market prices in the context of an exponential affine specification of the stochastic discount factor.     

Multilevel dual approach for pricing American style derivatives

In this article we propose a novel approach to reduce the computational complexity of the dual method for pricing American options. We consider a sequence of martingales that converges to a given target martingale and decompose the original dual representation into a sum of representations that correspond to different levels of approximation to the target martingale. By next replacing in each representation true conditional expectations with their Monte Carlo estimates, we arrive at what one may call a multilevel dual Monte Carlo algorithm. The analysis of this algorithm reveals that the computational complexity of getting the corresponding target upper bound, due to the target martingale, can be significantly reduced. In particular, it turns out that using our new approach, we may construct a multilevel version of the well-known nested Monte Carlo algorithm of Andersen and Broadie (Manag. Sci. 50:1222–1234, 2004) that is, regarding complexity, virtually equivalent to a non-nested algorithm. The performance of this multilevel algorithm is illustrated by a numerical example.     

An improved convolution algorithm for discretely sampled Asian options

We suggest an improved FFT pricing algorithm for discretely sampled Asian options with general independently distributed returns in the underlying. Our work complements the studies of Carverhill and Clewlow [Risk, 1990, 3(4), 25–29], Benhamou [J. Comput. Finance, 2002, 6(1), 49–68], and Fusai and Meucci [J. Bank. Finance, 2008, 32(10), 2076–2088], and, if we restrict our attention only to log-normally distributed returns, also Ve?e? [Risk, 2002, 15(6), 113–116]. While the existing convolution algorithms compute the density of the underlying state variable by moving forward on a suitably defined state space grid, our new algorithm uses backward price convolution, which resembles classical lattice pricing algorithms. For the first time in the literature we provide an analytical upper bound for the pricing error caused by the truncation of the state space grid and by the curtailment of the integration range. We highlight the benefits of the new scheme and benchmark its performance against existing finite difference, Monte Carlo, and forward density convolution algorithms.     

American options under stochastic volatility: control variates,maturity randomization & multiscale asymptotics

American options are actively traded worldwide on exchanges, thus making their accurate and efficient pricing an important problem. As most financial markets exhibit randomly varying volatility, in this paper we introduce an approximation of an American option price under stochastic volatility models. We achieve this by using the maturity randomization method known as Canadization. The volatility process is characterized by fast and slow-scale fluctuating factors. In particular, we study the case of an American put with a single underlying asset and use perturbative expansion techniques to approximate its price as well as the optimal exercise boundary up to the first order. We then use the approximate optimal exercise boundary formula to price an American put via Monte Carlo. We also develop efficient control variates for our simulation method using martingales resulting from the approximate price formula. A numerical study is conducted to demonstrate that the proposed method performs better than the least squares regression method popular in the financial industry, in typical settings where values of the scaling parameters are small. Further, it is empirically observed that in the regimes where the scaling parameter value is equal to unity, fast and slow-scale approximations are equally accurate.     

Binomial Option Pricing Biases and Inconsistent Implied Volatilities

We evaluate the binomial option pricing methodology (OPM) by examining simulated portfolio strategies. A key aspect of our study involves sampling from the empirical distribution of observed equity returns. Using a Monte Carlo simulation, we generate equity prices under known volatility and return parameters. We price American–style put options on the equity and evaluate the risk–adjusted performance of various strategies that require writing put options with different maturities and moneyness characteristics. The performance of these strategies is compared to an alternative strategy of investing in the underlying equity. The relative performance of the strategies allows us to identify biases in the binomial OPM leading to the well–known volatility smile . By adjusting option prices so as to rule out dominated option strategies in a mean–variance context, we are able to reduce the pricing errors of the OPM with respect to option prices obtained from the LIFFE. Our results suggest that a simple recalibration of inputs may improve binomial OPM performance.     

An efficient algorithm for pricing barrier options in arbitrage-free binomial models with calibrated drift terms

The interrelation between the drift coefficient of price processes on arbitrage-free financial markets and the corresponding transition probabilities induced by a martingale measure is analysed in a discrete setup. As a result, we obtain a flexible setting that encompasses most arbitrage-free binomial models. It is argued that knowledge of the link between drift and transition probabilities may be useful for pricing derivatives such as barrier options. The idea is illustrated in a simple example and later extended to a general numerical procedure. The results indicate that the option values in our fitted drift model converge much faster to closed-form solutions of continuous models for a wider range of contract specifications than those of conventional binomial models.     

On the Robustness of Least-Squares Monte Carlo (LSM) for Pricing American Derivatives

This paper analyses the robustness of Least-Squares Monte Carlo, a technique proposed by Longstaff and Schwartz (2001) for pricing American options. This method is based on least-squares regressions in which the explanatory variables are certain polynomial functions. We analyze the impact of different basis functions on option prices. Numerical results for American put options show that this approach is quite robust to the choice of basis functions. For more complex derivatives, this choice can slightly affect option prices. This revised version was published online in June 2006 with corrections to the Cover Date.     

Sequential real rainbow options

We develop two models to value European sequential rainbow options. The first model is a sequential option on the better of two stochastic assets, where these assets follow correlated geometric Brownian motion processes. The second model is a sequential option on the mean-reverting spread between two assets, which is applicable if the assets are co-integrated. We provide numerical solutions in the form of finite difference frameworks and compare these with Monte Carlo simulations. For the sequential option on a mean-reverting spread, we also provide a closed-form solution. Sensitivity analysis provides the interesting results that in particular circumstances, the sequential rainbow option value is negatively correlated with the volatility of one of the two assets, and that the sequential option on the spread does not necessarily increase in value with a longer time to maturity. With given maturity dates, it is preferable to have less time until expiry of the sequential option if the current spread level is way above the long-run mean.     

Fast and accurate pricing of barrier options under Lévy processes

We suggest two new fast and accurate methods, the fast Wiener–Hopf (FWH) method and the iterative Wiener–Hopf (IWH) method, for pricing barrier options for a wide class of Lévy processes. Both methods use the Wiener–Hopf factorization and the fast Fourier transform algorithm. We demonstrate the accuracy and fast convergence of both methods using Monte Carlo simulations and an accurate finite difference scheme, compare our results with those obtained by the Cont–Voltchkova method, and explain the differences in prices near the barrier. The first author is supported, in part, by grant RFBR 09-01-00781.