TL;DR: The multi-dimensional Black-Scholes equation is solved numerically for a European call basket option using a priori-a posteriori error estimates and the performance of the method is illustrated by examples in one, two, and three dimensions.
Abstract: The multi-dimensional Black-Scholes equation is solved numerically for a European call basket option using a priori-a posteriori error estimates The equation is discretized by a finite difference method on a Cartesian grid The grid is adjusted dynamically in space and time to satisfy a bound on the global error The discretization errors in each time step are estimated and weighted by the solution of the adjoint problem Bounds on the local errors and the adjoint solution are obtained by the maximum principle for parabolic equations Comparisons are made with Monte Carlo and quasi-Monte Carlo methods in one dimension, and the performance of the method is illustrated by examples in one, two, and three dimensions
TL;DR: In this paper, the copula of a bivariate random vector is computed when partial information is available, such as the value of a copula on a given subset of [0, 1]2, or the values of a functional of the copulum, monotone with respect to the concordance order.
Abstract: Improved bounds on the copula of a bivariate random vector are computed when partial information is available, such as the values of the copula on a given subset of [0, 1]2, or the value of a functional of the copula, monotone with respect to the concordance order. These results are then used to compute model-free bounds on the prices of two-asset options which make use of extra information about the dependence structure, such as the price of another two-asset option.
TL;DR: An efficient linear programming relaxation of the general problem based on an integral transform interpretation of the call price function is introduced, and it is shown that this relaxation is tight in some of the special cases examined before.
Abstract: We consider the problem of computing upper and lower bounds on the price of an European basket call option, given prices on other similar options. Although this problem is hard to solve exactly in the general case, we show that in some instances the upper and lower bounds can be computed via simple closed-form expressions, or linear programs. We also introduce an efficient linear programming relaxation of the general problem based on an integral transform interpretation of the call price function. We show that this relaxation is tight in some of the special cases examined before.
TL;DR: In this paper, the authors developed several regression algorithms for solving general stochastic optimal control problems via Monte Carlo, which is particularly useful for problems with a high-dimensional state space and complex dependence structure of the underlying Markov process with respect to some control.
Abstract: In this paper we develop several regression algorithms for solving general stochastic optimal control problems via Monte Carlo. This type of algorithm is particularly useful for problems with a high-dimensional state space and complex dependence structure of the underlying Markov process with respect to some control. The main idea behind the algorithms is to simulate a set of trajectories under some reference measure and to use the Bellman principle combined with fast methods for approximating conditional expectations and functional optimization. Theoretical properties of the presented algorithms are investigated, and the convergence to the optimal solution is proved under some assumptions. Finally, the presented methods are applied in a numerical example of a high-dimensional controlled Bermudan basket option in a financial market with a large investor.
TL;DR: In this paper, the authors consider the pricing of European Asian options in the Black-Scholes framework and consider three methods for evaluating the price of an Asian option, and contribute to all three.
Abstract: This paper considers the pricing of European Asian options in the Black-Scholes framework. All approaches we consider are readily extendable to the case of an Asian basket option. We consider three methods for evaluating the price of an Asian option, and contribute to all three. Firstly, we show the link between the approaches of Rogers and Shi [1995], Andreasen [1999], Hoogland and Neumann [2000] and Veceř [2001]. For the latter formulation we propose two reductions, which increase the numerical stability and reduce the calculation time. Secondly, we show how a closed-form expression can be derived for Curran’s and Rogers and Shi’s lower bound for the general case of multiple underlyings. Thirdly, we considerably sharpen Thompson’s [1999a,b] upper bound such that it is tighter than all known upper bounds. Finally, we consider analytical approximations and combine the traditional moment matching approximations with Curran’s conditioning approach. The resulting class of partially exact and bounded approximations can be proven to lie between a sharp lower and upper bound. In numerical examples we demonstrate that they outperform all current state-of-the-art bounds and approximations.