Guaranteed deterministic approach to superhedging: sensitivity of solutions of the Bellman-Isaacs equations and numerical methods
DOI10.1007/s10598-020-09499-3zbMath1460.91277OpenAlexW3093644497MaRDI QIDQ830988
Publication date: 10 May 2021
Published in: Computational Mathematics and Modeling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10598-020-09499-3
numerical methodstructural stabilitymixed strategiesmultivalued mappingoptioncomputational geometryLipschitz propertysuper-replicationBellman-Isaacs equationsapproximation accuracyguaranteed boundsconcave hull of a functiondeterministic price dynamicsgame equilibriumrobust no-arbitrage condition
Related Items (3)
Uses Software
Cites Work
- Guaranteed deterministic approach to superhedging: Lipschitz properties of solutions of the Bellman-Isaacs equations
- Guaranteed deterministic approach to superhedging: properties of binary European option
- Algorithms of optimal set covering on the planar R^2
- A FORMAL PROOF OF THE KEPLER CONJECTURE
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Guaranteed deterministic approach to superhedging: sensitivity of solutions of the Bellman-Isaacs equations and numerical methods