Primal and dual optimal stopping with signatures
Christian Bayer et al.
Abstract
We propose two signature-based methods to solve an optimal stopping problem – that is, to price American options – in non-Markovian frameworks. Both methods rely on a global approximation result for $L^{p}$ L p -functionals on rough-path spaces, using linear functionals of robust, rough-path signatures. In the primal formulation, we present a non-Markovian generalisation of the famous Longstaff–Schwartz algorithm, using linear functionals of the signature as regression basis. For the dual formulation, we parametrise the space of square-integrable martingales using linear functionals of the signature and apply a sample average approximation. We prove convergence for both methods and present first numerical examples in non-Markovian and non-semimartingale regimes.
Evidence weight
Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40
| F · citation impact | 0.50 × 0.4 = 0.20 |
| M · momentum | 0.50 × 0.15 = 0.07 |
| V · venue signal | 0.50 × 0.05 = 0.03 |
| R · text relevance † | 0.50 × 0.4 = 0.20 |
† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.