Pricing and Hedging Asian Basket Options with Quasi-Monte Carlo Simulations

In this article we consider the problem of pricing and hedging high-dimensional Asian basket options by Quasi-Monte Carlo simulation. We assume a Black-Scholes market with time-dependent volatilities and show how to compute the deltas by the aid of the Malliavin Calculus, extending the procedure employed by Montero and Kohatsu-Higa (2003). Efficient path-generation algorithms, such as Linear Transformation and Principal Component Analysis, exhibit a high computational cost in a market with time-dependent volatilities. We present a new and fast Cholesky algorithm for block matrices that makes the Linear Transformation even more convenient. Moreover, we propose a new-path generation technique based on a Kronecker Product Approximation. This construction returns the same accuracy of the Linear Transformation used for the computation of the deltas and the prices in the case of correlated asset returns while requiring a lower computational time. All these techniques can be easily employed for stochastic volatility models based on the mixture of multi-dimensional dynamics introduced by Brigo et al. (2004).Comment: 16 page

A Generalisation of Malliavin Weighted Scheme for Fast Computation of the Greeks

This paper presented a new technique for the simulation of the Greeks (i.e. price sensitivities to parameters), efficient for strongly discontinuous payo¤ options. The use of Malliavin calculus, by means of an integration by parts, enables to shift the differentiation operator from the payo¤ function to the diffusion kernel, introducing a weighting function.(Fournie et al. (1999)). Expressing the weighting function as a Skorohod integral, we show how to characterize the integrand with necessary and sufficient conditions, giving a complete description of weighting function solutions. Interestingly, for adapted process, the Skorohod integral turns to be the classical Ito integral.Monte-Carlo, Quasi-Monte Carlo, Greeks,Malliavin Calculus, Wiener Chaos.

Sequential Monte Carlo Methods for Option Pricing

In the following paper we provide a review and development of sequential Monte Carlo (SMC) methods for option pricing. SMC are a class of Monte Carlo-based algorithms, that are designed to approximate expectations w.r.t a sequence of related probability measures. These approaches have been used, successfully, for a wide class of applications in engineering, statistics, physics and operations research. SMC methods are highly suited to many option pricing problems and sensitivity/Greek calculations due to the nature of the sequential simulation. However, it is seldom the case that such ideas are explicitly used in the option pricing literature. This article provides an up-to date review of SMC methods, which are appropriate for option pricing. In addition, it is illustrated how a number of existing approaches for option pricing can be enhanced via SMC. Specifically, when pricing the arithmetic Asian option w.r.t a complex stochastic volatility model, it is shown that SMC methods provide additional strategies to improve estimation.Comment: 37 Pages, 2 Figure

Importance Sampling for Pathwise Sensitivity of Stochastic Chaotic Systems

This paper proposes a new pathwise sensitivity estimator for chaotic SDEs. By introducing a spring term between the original and perturbated SDEs, we derive a new estimator by importance sampling. The variance of the new estimator increases only linearly in time $T,$ compared with the exponential increase of the standard pathwise estimator. We compare our estimator with the Malliavin estimator and extend both of them to the Multilevel Monte Carlo method, which further improves the computational efficiency. Finally, we also consider using this estimator for the SDE with small volatility to approximate the sensitivities of the invariant measure of chaotic ODEs. Furthermore, Richardson-Romberg extrapolation on the volatility parameter gives a more accurate and efficient estimator. Numerical experiments support our analysis.Comment: 29 pages, 31 figure

Rolling Adjoints: Fast Greeks along Monte Carlo scenarios for early-exercise options

In this paper we extend the Stochastic Grid Bundling Method (SGBM), a regress-later Monte Carlo scheme for pricing early-exercise options, with an adjoint method to compute in a highly efficient manner the option sensitivities (the “Greeks”) along the Monte Carlo paths, with reasonable accuracy. The path-wise SGBM Greeks computation is based on the conventional path-wise sensitivity analysis, however, for a regress-later technique. The resulting sensitivities at the end of the monitoring period are implicitly rolled over into the sensitivities of the regression coefficients of the previous monitoring date. For this reason, we name the method Rolling Adjoints, which facilitates Smoking Adjoints [M. Giles, P. Glasserman, Smoking adjoints: fast Monte Carlo Greeks, Risk 19 (1)(2006)88–92] to compute conditional sensitivities along the paths for options with early-exercise features

Rolling Adjoints: Fast Greeks along Monte Carlo scenarios for early-exercise options

In this paper we extend the stochastic grid bundling method (SGBM), a regress-later based Monte Carlo scheme for pricing early-exercise options, with an adjoint method to compute in a highly efficient manner sensitivities along the paths, with reasonable accuracy. With the ISDA standard initial margin model being adopted by the financial markets, computing sensitivities along scenarios is required to compute quantities like the margin valuation adjustment

A generalisation of Malliavin weighted scheme for fast computation of the Greeks

This paper presented a new technique for the simulation of the Greeks (i.e. price sensitivities to parameters), efficient for strongly discontinuous payoff options. The use of Malliavin calculus, by means of an integration by parts, enables to shift the differentiation operator from the payoff function to the diffusion kernel, introducing a weighting function (Fournie et al. (1999)). Expressing the weighting function as a Skorohod integral, we show how to characterize the integrand with necessary and sufficient conditions, giving a complete description of weighting function solutions. Interestingly, for adapted process, the Skorohod integral turns to be the classical Ito integral