Linear-time option pricing algorithms by combinatorics
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3712896 (Why is no real title available?)
- scientific article; zbMATH DE number 51878 (Why is no real title available?)
- scientific article; zbMATH DE number 1869203 (Why is no real title available?)
- scientific article; zbMATH DE number 6137478 (Why is no real title available?)
- Approximate option pricing
- Financial engineering and computation. Principles, mathematics, algorithms
- Option pricing: A simplified approach
- PRICING AND HEDGING DOUBLE‐BARRIER OPTIONS: A PROBABILISTIC APPROACH
- Pricing Options With Curved Boundaries1
- The pricing of options and corporate liabilities
Cited in
(11)- Pricing complexity options
- Option strategies with linear programming
- Ant Colony Optimization for Option Pricing
- Very fast algorithms for implied barriers and moving-barrier options pricing
- High Performance Implementation of Binomial Option Pricing
- Spectral binomial tree: new algorithms for pricing barrier options
- An efficient and accurate lattice for pricing derivatives under a jump-diffusion process
- Computationally simple lattice methods for option and bond pricing
- Linear-time accurate lattice algorithms for tail conditional expectation
- Pricing ladder options with combinatorics
- scientific article; zbMATH DE number 2133128 (Why is no real title available?)
This page was built for publication: Linear-time option pricing algorithms by combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483085)