On the use of policy iteration as an easy way of pricing American options
From MaRDI portal
Publication:4902222
Abstract: In this paper, we demonstrate that policy iteration, introduced in the context of HJB equations in [Forsyth & Labahn, 2007], is an extremely simple generic algorithm for solving linear complementarity problems resulting from the finite difference and finite element approximation of American options. We show that, in general, O(N) is an upper and lower bound on the number of iterations needed to solve a discrete LCP of size N. If embedded in a class of standard discretisations with M time steps, the overall complexity of American option pricing is indeed only O(N(M+N)), and, therefore, for M N, identical to the pricing of European options, which is O(MN). We also discuss the numerical properties and robustness with respect to model parameters in relation to penalty and projected relaxation methods.
Recommendations
- A policy iteration algorithm for the American put option and free boundary control problems
- scientific article; zbMATH DE number 6311734
- scientific article; zbMATH DE number 2065148
- On the solution of complementarity problems arising in American options pricing
- Résolution Numérique De Problèmes De Complémentarité Linéaire Et Évaluation D'Options Américaines
Cited in
(21)- A fixed point method for the linear complementarity problem arising from American option pricing
- PRICING AMERICAN OPTIONS WITH THE RUNGE–KUTTA–LEGENDRE FINITE DIFFERENCE SCHEME
- Policy iteration for american options: overview
- Dynamic intertemporal utility optimization by means of Riccati transformation of Hamilton-Jacobi-Bellman equation
- Enhanced policy iteration for American options via scenario selection
- Modulus-based successive overrelaxation iteration method for pricing American options with the two-asset Black-Scholes and Heston's models based on finite volume discretization
- A policy iteration algorithm for the American put option and free boundary control problems
- A generalized Newton method for a class of discrete-time linear complementarity systems
- Haar‐wavelet based approximation for pricing American options under linear complementarity formulations
- Error estimates of penalty schemes for quasi-variational inequalities arising from impulse control problems
- A spectral element method for option pricing under regime-switching with jumps
- Optimization model to start harvesting in stochastic aquaculture system
- A transformation method for solving the Hamilton-Jacobi-Bellman equation for a constrained dynamic stochastic optimal allocation problem
- Investment flexibility as a barrier to entry
- Anderson Acceleration for Nonsmooth Fixed Point Problems
- Stabilized explicit Runge-Kutta methods for multi-asset American options
- A deep learning approach for computations of exposure profiles for high-dimensional Bermudan options
- A fast preconditioned policy iteration method for solving the tempered fractional HJB equation governing American options valuation
- Deep learning for CVA computations of large portfolios of financial derivatives
- A finite difference scheme for variational inequalities arising in stochastic control problems with several singular control variables
- A comparison of iterated optimal stopping and local policy iteration for American options under regime switching
This page was built for publication: On the use of policy iteration as an easy way of pricing American options
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902222)
