A new elementary geometric approach to option pricing bounds in discrete time models
From MaRDI portal
(Redirected from Publication:320923)
Recommendations
Cites work
- scientific article; zbMATH DE number 5181830 (Why is no real title available?)
- A course in derivative securities. Introduction to theory and computation.
- A general construction of barycentric coordinates over convex polygons
- An approximate moving boundary method for American option pricing
- Arbitrage Theory in Continuous Time
- Assessing financial model risk
- Binomial models in finance.
- COMPUTATIONAL GEOMETRY COLUMN 45
- Calibrated American option pricing by stochastic linear programming
- Construction of polygonal interpolants: a maximum entropy approach
- Duality and martingales: a stochastic programming perspective on contingent claims
- Expected gain-loss pricing and hedging of contingent claims in incomplete markets by linear programming
- Finding the convex hull of a simple polygon
- Mathematics for computer graphics
- Mathematics of financial markets.
- No-arbitrage bounds for financial scenarios
- On the no-arbitrage condition in option implied trees
- Option pricing by mathematical programming†
- Pricing American contingent claims by stochastic linear programming
- Scenarios for multistage stochastic programs
- The analysis of finite security markets using martingales
Cited in
(1)
This page was built for publication: A new elementary geometric approach to option pricing bounds in discrete time models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320923)