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.     

美式期权的Monte Carlo模拟法定价理论及应用

近年来随着计算机技术的飞速发展,美式期权的Monte Carlo模拟法定价取得了实质性的突破。本文分析介绍了美式期权的Monte Carlo模拟法定价理论及在此基础上推导出的线性回归MonteCarlo模拟法定价公式及其在实际的应用。     

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.     

On an efficient multiple time step Monte Carlo simulation of the SABR model

In this paper, we will present a multiple time step Monte Carlo simulation technique for pricing options under the Stochastic Alpha Beta Rho model. The proposed method is an extension of the one time step Monte Carlo method that we proposed in an accompanying paper Leitao et al. [Appl. Math. Comput. 2017, 293, 461–479], for pricing European options in the context of the model calibration. A highly efficient method results, with many very interesting and nontrivial components, like Fourier inversion for the sum of log-normals, stochastic collocation, Gumbel copula, correlation approximation, that are not yet seen in combination within a Monte Carlo simulation. The present multiple time step Monte Carlo method is especially useful for long-term options and for exotic options.     

Efficient willow tree method for European-style and American-style moving average barrier options pricing

Moving average options are widely traded in financial markets, but exiting methods for pricing this type of option are too slow. This paper proposes two efficient willow tree methods for pricing European-style and American-style moving average barrier options (MABOs). We first solve the finite-dimensional partial differential equation model for discretely monitored MABOs by willow tree methods, and then compute the value of continuously monitored MABOs by Richardson’s two-point extrapolation. Our new willow tree method employs the interpolation error minimization technique to reduce complexity. The corresponding convergence rate and error bounds are also analyzed. It shows that our proposed methods can provide the same accuracy as the binomial tree approach and Monte Carlo simulation, but require much less computing time. The numerical experiments support our claims.     

Pricing high-dimensional American options by kernel ridge regression

In this paper, we propose using kernel ridge regression (KRR) to avoid the step of selecting basis functions for regression-based approaches in pricing high-dimensional American options by simulation. Our contribution is threefold. Firstly, we systematically introduce the main idea and theory of KRR and apply it to American option pricing for the first time. Secondly, we show how to use KRR with the Gaussian kernel in the regression-later method and give the computationally efficient formulas for estimating the continuation values and the Greeks. Thirdly, we propose to accelerate and improve the accuracy of KRR by performing local regression based on the bundling technique. The numerical test results show that our method is robust and has both higher accuracy and efficiency than the Least Squares Monte Carlo method in pricing high-dimensional American options.     

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.     

Pricing via recursive quantization in stochastic volatility models

We provide the first recursive quantization-based approach for pricing options in the presence of stochastic volatility. This method can be applied to any model for which an Euler scheme is available for the underlying price process and it allows one to price vanillas, as well as exotics, thanks to the knowledge of the transition probabilities for the discretized stock process. We apply the methodology to some celebrated stochastic volatility models, including the Stein and Stein [Rev. Financ. Stud. 1991, (4), 727–752] model and the SABR model introduced in Hagan et al. [Wilmott Mag., 2002, 84–108]. A numerical exercise shows that the pricing of vanillas turns out to be accurate; in addition, when applied to some exotics like equity-volatility options, the quantization-based method overperforms by far the Monte Carlo simulation.     

Multilevel Monte Carlo for exponential Lévy models

We apply the multilevel Monte Carlo method for option pricing problems using exponential Lévy models with a uniform timestep discretisation. For lookback and barrier options, we derive estimates of the convergence rate of the error introduced by the discrete monitoring of the running supremum of a broad class of Lévy processes. We then use these to obtain upper bounds on the multilevel Monte Carlo variance convergence rate for the variance gamma, NIG and \(\alpha\)-stable processes. We also provide an analysis of a trapezoidal approximation for Asian options. Our method is illustrated by numerical experiments.     

American option pricing with discrete and continuous time models: An empirical comparison

This paper considers discrete time GARCH and continuous time SV models and uses these for American option pricing. We first of all show that with a particular choice of framework the parameters of the SV models can be estimated using simple maximum likelihood techniques. We then perform a Monte Carlo study to examine their differences in terms of option pricing, and we study the convergence of the discrete time option prices to their implied continuous time values. Finally, a large scale empirical analysis using individual stock options and options on an index is performed comparing the estimated prices from discrete time models to the corresponding continuous time model prices. The results show that, while the overall differences in performance are small, for the in the money put options on individual stocks the continuous time SV models do generally perform better than the discrete time GARCH specifications.     

Testing Conditional Asset Pricing Models Using a Markov Chain Monte Carlo Approach

We use Markov Chain Monte Carlo (MCMC) methods for the parameter estimation and the testing of conditional asset pricing models. In contrast to traditional approaches, it is truly conditional because the assumption that time variation in betas is driven by a set of conditioning variables is not necessary. Moreover, the approach has exact finite sample properties and accounts for errors‐in‐variables. Using S&P 500 panel data, we analyse the empirical performance of the CAPM and the Fama and French (1993) three‐factor model. We find that time‐variation of betas in the CAPM and the time variation of the coefficients for the size factor (SMB) and the distress factor (HML) in the three‐factor model improve the empirical performance. Therefore, our findings are consistent with time variation of firm‐specific exposure to market risk, systematic credit risk and systematic size effects. However, a Bayesian model comparison trading off goodness of fit and model complexity indicates that the conditional CAPM performs best, followed by the conditional three‐factor model, the unconditional CAPM, and the unconditional three‐factor model.     

Least-squares Importance Sampling for Monte Carlo security pricing

We describe a simple Importance Sampling strategy for Monte Carlo simulations based on a least-squares optimization procedure. With several numerical examples, we show that such Least-squares Importance Sampling (LSIS) provides efficiency gains comparable to the state-of-the-art techniques, for problems that can be formulated in terms of the determination of the optimal mean of a multivariate Gaussian distribution. In addition, LSIS can be naturally applied to more general Importance Sampling densities and is particularly effective when the ability to adjust higher moments of the sampling distribution, or to deal with non-Gaussian or multi-modal densities, is critical to achieve variance reductions.     

Quasi-Monte Carlo methods with applications in finance

We review the basic principles of quasi-Monte Carlo (QMC) methods, the randomizations that turn them into variance-reduction techniques, the integration error and variance bounds obtained in terms of QMC point set discrepancy and variation of the integrand, and the main classes of point set constructions: lattice rules, digital nets, and permutations in different bases. QMC methods are designed to estimate s-dimensional integrals, for moderate or large (perhaps infinite) values of s. In principle, any stochastic simulation whose purpose is to estimate an integral fits this framework, but the methods work better for certain types of integrals than others (e.g., if the integrand can be well approximated by a sum of low-dimensional smooth functions). Such QMC-friendly integrals are encountered frequently in computational finance and risk analysis. We summarize the theory, give examples, and provide computational results that illustrate the efficiency improvement achieved. This article is targeted mainly for those who already know Monte Carlo methods and their application in finance, and want an update of the state of the art on quasi-Monte Carlo methods.      

Hierarchical adaptive sparse grids and quasi-Monte Carlo for option pricing under the rough Bergomi model

The rough Bergomi (rBergomi) model, introduced recently in Bayer et al. [Pricing under rough volatility. Quant. Finance, 2016, 16(6), 887–904], is a promising rough volatility model in quantitative finance. It is a parsimonious model depending on only three parameters, and yet remarkably fits empirical implied volatility surfaces. In the absence of analytical European option pricing methods for the model, and due to the non-Markovian nature of the fractional driver, the prevalent option is to use the Monte Carlo (MC) simulation for pricing. Despite recent advances in the MC method in this context, pricing under the rBergomi model is still a time-consuming task. To overcome this issue, we have designed a novel, hierarchical approach, based on: (i) adaptive sparse grids quadrature (ASGQ), and (ii) quasi-Monte Carlo (QMC). Both techniques are coupled with a Brownian bridge construction and a Richardson extrapolation on the weak error. By uncovering the available regularity, our hierarchical methods demonstrate substantial computational gains with respect to the standard MC method. They reach a sufficiently small relative error tolerance in the price estimates across different parameter constellations, even for very small values of the Hurst parameter. Our work opens a new research direction in this field, i.e. to investigate the performance of methods other than Monte Carlo for pricing and calibrating under the rBergomi model.     

Backward simulation methods for pricing American options under the CIR process

In this paper, we focus on backward simulation of the CIR process. The purpose is to solve the memory requirement issue of the Least Squares Monte Carlo method when pricing American options by simulation. The concept of backward simulation is presented and it is classified into two types. Under the framework of the second type backward simulation, we seek the solutions for the existing CIR schemes. Specifically, we propose forward–backward simulation approaches for Alfonsi’s two implicit schemes, the fixed Euler schemes and the exact scheme. The proposed schemes are numerically tested and compared in pricing American options under the Heston model and the stochastic interest rate model. Some numerical properties such as the convergence order of the explicit–implicit Euler schemes, the storage requirement estimation of the forward–backward exact scheme and its computing time comparison with the squared Bessel bridge are also tested. Finally, the pros and cons of the related backward simulation schemes are summarized.     

Efficient and accurate quadratic approximation methods for pricing Asian strike options

This study is on valuing Asian strike options and presents efficient and accurate quadratic approximation methods that work extremely well, both with regard to the volatility of a wide range of underlying assets, and longer average time windows. We demonstrate that most of the well-known quadratic approximation methods used in the literature for pricing Asian strike options are special cases of our model, with the numerical results demonstrating that our method significantly outperforms the other quadratic approximation methods examined here. Using our method for the calculation of hundreds of Asian strike options, the pricing errors (in terms of the root mean square errors) are reasonably small. Compared with the Monte Carlo benchmark method, our method is shown to be rapid and accurate. We further extend our method to the valuing of quanto forward-starting Asian strike options, with the pricing accuracy of these options being largely the same as the pricing of plain vanilla Asian strike options.     

Regression-based algorithms for life insurance contracts with surrender guarantees

We present a general framework for pricing life insurance contracts embedding a surrender option. The model allows for several sources of risk, such as uncertainty in mortality, interest rates and other financial factors. We describe and compare two numerical schemes based on the Least Squares Monte Carlo method, emphasizing underlying modeling assumptions and computational issues.     

Approximation methods for piecewise deterministic Markov processes and their costs

In this paper, we analyse piecewise deterministic Markov processes (PDMPs), as introduced in Davis (1984). Many models in insurance mathematics can be formulated in terms of the general concept of PDMPs. There one is interested in computing certain quantities of interest such as the probability of ruin or the value of an insurance company. Instead of explicitly solving the related integro-(partial) differential equation (an approach which can only be used in few special cases), we adapt the problem in a manner that allows us to apply deterministic numerical integration algorithms such as quasi-Monte Carlo rules; this is in contrast to applying random integration algorithms such as Monte Carlo. To this end, we reformulate a general cost functional as a fixed point of a particular integral operator, which allows for iterative approximation of the functional. Furthermore, we introduce a smoothing technique which is applied to the integrands involved, in order to use error bounds for deterministic cubature rules. We prove a convergence result for our PDMPs approximation, which is of independent interest as it justifies phase-type approximations on the process level. We illustrate the smoothing technique for a risk-theoretic example, and compare deterministic and Monte Carlo integration.