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.
Read full abstract