An exact subexponential-time lattice algorithm for Asian options
From MaRDI portal
Publication:878377
DOI10.1007/s00236-006-0033-9zbMath1136.91425MaRDI QIDQ878377
Publication date: 26 April 2007
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/154527/1/17.pdf
Related Items
An efficient and accurate lattice for pricing derivatives under a jump-diffusion process, Accurate and efficient lattice algorithms for American-style Asian options with range bounds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Pricing of Options and Corporate Liabilities
- A refined binomial lattice for pricing American Asian options
- Martingales and stochastic integrals in the theory of continuous trading
- Connecting discrete and continuous path-dependent options
- Monte Carlo methods for security pricing
- Convergence of numerical methods for valuing path-dependent options using interpolation
- Efficient, exact algorithms for Asian options with multiresolution lattices
- Approximate option pricing
- An efficient convergent lattice algorithm for European Asian options
- PRICING OF AMERICAN PATH-DEPENDENT CONTINGENT CLAIMS
- The Valuation of Path Dependent Contracts on the Average
- Estimating Security Price Derivatives Using Simulation
- BESSEL PROCESSES, ASIAN OPTIONS, AND PERPETUITIES
- Numerical Inversion of Laplace Transforms of Probability Distributions
- The value of an Asian option
- Valuing American Options by Simulation: A Simple Least-Squares Approach
- Option pricing: A simplified approach