7,597 research outputs found
Efficient hierarchical approximation of high-dimensional option pricing problems
A major challenge in computational finance is the pricing of options that depend on a large number of risk factors. Prominent examples are basket or index options where dozens or even hundreds of stocks constitute the underlying asset and determine the dimensionality of the corresponding degenerate parabolic equation. The objective of this article is to show how an efficient discretisation can be achieved by hierarchical approximation as well as asymptotic expansions of the underlying continuous problem. The relation to a number of state-of-the-art methods is highlighted
Sequential Design for Optimal Stopping Problems
We propose a new approach to solve optimal stopping problems via simulation.
Working within the backward dynamic programming/Snell envelope framework, we
augment the methodology of Longstaff-Schwartz that focuses on approximating the
stopping strategy. Namely, we introduce adaptive generation of the stochastic
grids anchoring the simulated sample paths of the underlying state process.
This allows for active learning of the classifiers partitioning the state space
into the continuation and stopping regions. To this end, we examine sequential
design schemes that adaptively place new design points close to the stopping
boundaries. We then discuss dynamic regression algorithms that can implement
such recursive estimation and local refinement of the classifiers. The new
algorithm is illustrated with a variety of numerical experiments, showing that
an order of magnitude savings in terms of design size can be achieved. We also
compare with existing benchmarks in the context of pricing multi-dimensional
Bermudan options.Comment: 24 page
Review of modern numerical methods for a simple vanilla option pricing problem
Option pricing is a very attractive issue of financial engineering and optimization. The problem of determining the fair price of an option arises from the assumptions made under a given financial market model. The increasing complexity of these market assumptions contributes to the popularity of the numerical treatment of option valuation. Therefore, the pricing and hedging of plain vanilla options under the Black–Scholes model usually serve as a bench-mark for the development of new numerical pricing approaches and methods designed for advanced option pricing models. The objective of the paper is to present and compare the methodological concepts for the valuation of simple vanilla options using the relatively modern numerical techniques in this issue which arise from the discontinuous Galerkin method, the wavelet approach and the fuzzy transform technique. A theoretical comparison is accompanied by an empirical study based on the numerical verification of simple vanilla option prices. The resulting numerical schemes represent a particularly effective option pricing tool that enables some features of options that are depend-ent on the discretization of the computational domain as well as the order of the polynomial approximation to be captured better
Pricing American Options by Exercise Rate Optimization
We present a novel method for the numerical pricing of American options based
on Monte Carlo simulation and the optimization of exercise strategies. Previous
solutions to this problem either explicitly or implicitly determine so-called
optimal exercise regions, which consist of points in time and space at which a
given option is exercised. In contrast, our method determines the exercise
rates of randomized exercise strategies. We show that the supremum of the
corresponding stochastic optimization problem provides the correct option
price. By integrating analytically over the random exercise decision, we obtain
an objective function that is differentiable with respect to perturbations of
the exercise rate even for finitely many sample paths. The global optimum of
this function can be approached gradually when starting from a constant
exercise rate.
Numerical experiments on vanilla put options in the multivariate
Black-Scholes model and a preliminary theoretical analysis underline the
efficiency of our method, both with respect to the number of
time-discretization steps and the required number of degrees of freedom in the
parametrization of the exercise rates. Finally, we demonstrate the flexibility
of our method through numerical experiments on max call options in the
classical Black-Scholes model, and vanilla put options in both the Heston model
and the non-Markovian rough Bergomi model
Pricing high-dimensional Bermudan options with hierarchical tensor formats
An efficient compression technique based on hierarchical tensors for popular
option pricing methods is presented. It is shown that the "curse of
dimensionality" can be alleviated for the computation of Bermudan option prices
with the Monte Carlo least-squares approach as well as the dual martingale
method, both using high-dimensional tensorized polynomial expansions. This
discretization allows for a simple and computationally cheap evaluation of
conditional expectations. Complexity estimates are provided as well as a
description of the optimization procedures in the tensor train format.
Numerical experiments illustrate the favourable accuracy of the proposed
methods. The dynamical programming method yields results comparable to recent
Neural Network based methods.Comment: 26 pages, 3 figures, 5 tables, added affiliations and update
acknowledgement
Reduced basis methods for pricing options with the Black-Scholes and Heston model
In this paper, we present a reduced basis method for pricing European and
American options based on the Black-Scholes and Heston model. To tackle each
model numerically, we formulate the problem in terms of a time dependent
variational equality or inequality. We apply a suitable reduced basis approach
for both types of options. The characteristic ingredients used in the method
are a combined POD-Greedy and Angle-Greedy procedure for the construction of
the primal and dual reduced spaces. Analytically, we prove the reproduction
property of the reduced scheme and derive a posteriori error estimators.
Numerical examples are provided, illustrating the approximation quality and
convergence of our approach for the different option pricing models. Also, we
investigate the reliability and effectivity of the error estimators.Comment: 25 pages, 27 figure
- …