In this paper we propose two efficient techniques which allow one to compute the price of American basket options. In particular, we consider a basket of assets that follow a multi-dimensional Black-Scholes dynamics. The proposed techniques, called GPR Tree (GRP-Tree) and GPR Exact Integration (GPR-EI), are both based on Machine Learning, exploited together with binomial trees or with a closed formula for integration. Moreover, these two methods solve the backward dynamic programming problem considering a Bermudan approximation of the American option. On the exercise dates, the value of the option is first computed as the maximum between the exercise value and the continuation value and then approximated by means of Gaussian Process Regression. The two methods mainly differ in the approach used to compute the continuation value: a single step of binomial tree or integration according to the probability density of the process. Numerical results show that these two methods are accurate and reliable in handling American options on very large baskets of assets. Moreover we also consider the rough Bergomi model, which provides stochastic volatility with memory. Despite this model is only bidimensional, the whole history of the process impacts on the price, and handling all this information is not obvious at all. To this aim, we present how to adapt the GPR-Tree and GPR-EI methods and we focus on pricing American options in this non-Markovian framework.Pricing American options is clearly a crucial question of finance but also a challenging one since computing the optimal exercise strategy is not an evident task. This issue is even more exacting when the underling of the option is a multi-dimensional process, such as a baskets of d assets, since in this case the direct application of standard numerical schemes, such as finite difference or tree methods, is not possible because of the exponential growth of the calculation time and the required working memory.Common approaches in this field can be divided in four groups: techniques which rely on recombinant trees to discretize the underlyings (see [4], [11] and [24]), techniques which employ regression on a truncated basis of L 2 in order to compute the conditional expectations (see [28] and [32]), techniques which exploit Malliavin calculus to obtain representation formulas for the conditional expectation (see [1], [3], [9], and [27]) and techniques which make use of duality-based approaches for Bermudan option pricing (see [21], [26] and [31]). Recently, Machine Learning algorithms (Rasmussen and Williams [33]) and Deep Learning techniques (Nielsen [30]) have found great application in this sector of option pricing. Neural networks are used by Kohler et al. [25] to price American options based on several underlyings. Deep Learning techniques are nowadays widely used in solving large differential equations, which is intimately related to option pricing. In particular, Han et al. [20] introduce a Deep Learning-based approach that can handle general high-dimensional parabo...

In this paper we propose an efficient method to compute the price of multi-asset American options, based on Machine Learning, Monte Carlo simulations and variance reduction technique. Specifically, the options we consider are written on a basket of assets, each of them following a Black-Scholes dynamics. In the wake of Ludkovski's approach [33], we implement here a backward dynamic programming algorithm which considers a finite number of uniformly distributed exercise dates. On these dates, the option value is computed as the maximum between the exercise value and the continuation value, which is obtained by means of Gaussian process regression technique and Monte Carlo simulations. Such a method performs well for low dimension baskets but it is not accurate for very high dimension baskets. In order to improve the dimension range, we employ the European option price as a control variate, which allows us to treat very large baskets and moreover to reduce the variance of price estimators. Numerical tests show that the proposed algorithm is fast and reliable, and it can handle also American options on very large baskets of assets, overcoming the problem of the curse of dimensionality.

No abstract

a b s t r a c tValuing Guaranteed Lifelong Withdrawal Benefit (GLWB) has attracted significant attention from both the academic field and real world financial markets. As remarked by Forsyth and Vetzal (2014) the Black and Scholes framework seems to be inappropriate for such a long maturity products. They propose to use a regime switching model. Alternatively, we propose here to use a stochastic volatility model (Heston model) and a Black-Scholes model with stochastic interest rate (Hull-White model). For this purpose we present four numerical methods for pricing GLWB variables annuities: a hybrid tree-finite difference method and a Hybrid Monte Carlo method, an ADI finite difference scheme, and a Standard Monte Carlo method. These methods are used to determine the no-arbitrage fee for the most popular versions of the GLWB contract, and to calculate the Greeks used in hedging. Both constant withdrawal and optimal withdrawal (including lapsation) strategies are considered. Numerical results are presented which demonstrate the sensitivity of the no-arbitrage fee to economic, contractual and longevity assumptions.

No abstract