Iterative construction of the optimal Bermudan stopping time

From MaRDI portal
Publication:2488505

DOI10.1007/s00780-005-0168-5zbMath1090.62088OpenAlexW2017684264MaRDI QIDQ2488505

Anastasia Kolodko, John G. M. Schoenmakers

Publication date: 24 May 2006

Published in: Finance and Stochastics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00780-005-0168-5




Related Items (26)

Sensitivities for Bermudan options by regression methodsMultilevel dual approach for pricing American style derivativesMultilevel Simulation Based Policy Iteration for Optimal Stopping--Convergence and ComplexityCounterparty Credit Exposures for Interest Rate Derivatives using the Stochastic Grid Bundling MethodEnhanced policy iteration for American options via scenario selectionFrom optimal martingales to randomized dual optimal stoppingLaplace transforms of stochastic integrals and the pricing of Bermudan swaptionsAn iterative method for multiple stopping: convergence and stabilityPrimal–dual linear Monte Carlo algorithm for multiple stopping—an application to flexible capsAdditive and multiplicative duals for American option pricingPractical policy iteration: generic methods for obtaining rapid and tight bounds for Bermudan exotic derivatives using Monte Carlo simulationEffective sub-simulation-free upper bounds for the Monte Carlo pricing of callable derivatives and various improvements to existing methodologiesRandomized Optimal Stopping Algorithms and Their Convergence AnalysisA pure martingale dual for multiple stoppingIterative Improvement of Lower and Upper Bounds for Backward SDEsA perturbative approach to Bermudan options pricing with applicationsTRUE UPPER BOUNDS FOR BERMUDAN PRODUCTS VIA NON‐NESTED MONTE CARLODeep optimal stoppingAn iterative procedure for solving integral equations related to optimal stopping problemsRegression methods in pricing American and Bermudan options using consumption processesMONTE CARLO EVALUATION OF AMERICAN OPTIONS USING CONSUMPTION PROCESSESSimple improvement method for upper bound of American optionGeneric improvements to least squares Monte Carlo methods with applications to optimal stopping problemsThe duality of optimal exercise and domineering claims: a Doob–Meyer decomposition approach to the Snell envelopeOn the forward algorithm for stopping problems on continuous-time Markov chainsSolving high-dimensional optimal stopping problems using deep learning




This page was built for publication: Iterative construction of the optimal Bermudan stopping time