scientific article; zbMATH DE number 1243617
From MaRDI portal
Publication:4226183
zbMath0939.91002MaRDI QIDQ4226183
Publication date: 21 January 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
hedgingoption pricingMonte Carlo methodsfinite-difference methodsMathematicasymbolic computationsnumerical computationsgraphical methodsbinomial and trinomial tree models
Numerical methods (including Monte Carlo methods) (91G60) Symbolic computation and algebraic computation (68W30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to game theory, economics, and finance (91-01)
Related Items (17)
A bias in the volatility smile ⋮ An exact subexponential-time lattice algorithm for Asian options ⋮ Existence of a fundamental solution of partial differential equations associated to Asian options ⋮ Analytical approximation of the transition density in a local volatility model ⋮ Pricing the financial Heston-Hull-White model with arbitrary correlation factors via an adaptive FDM ⋮ Prices and sensitivities of Asian options: A survey ⋮ Spline approximation method to solve an option pricing problem ⋮ Sharp estimates for Geman-Yor processes and applications to arithmetic average Asian options ⋮ A model of returns for the post-credit-crunch reality: hybrid Brownian motion with price feedback ⋮ Pricing and estimates of Greeks for passport option: A three time level approach ⋮ A meshless method for Asian style options pricing under the Merton jump-diffusion model ⋮ ON THE VALUATION OF DERIVATIVES WITH SNAPSHOT RESET FEATURES ⋮ Accurate and efficient lattice algorithms for American-style Asian options with range bounds ⋮ Displaced Diffusion as an Approximation of the Constant Elasticity of Variance ⋮ Valuation of American passport option using a three-time level scheme ⋮ PRICING DOUBLE BARRIER OPTIONS ON HOMOGENEOUS DIFFUSIONS: A NEUMANN SERIES OF BESSEL FUNCTIONS REPRESENTATION ⋮ An efficient convergent lattice algorithm for European Asian options
Uses Software
This page was built for publication: