Maximizing functionals of the maximum in the Skorokhod embedding problem and an application to variance swaps
David Hobson, Martin Klimmek

TL;DR
This paper extends the Azéma-Yor and Perkins solutions of the Skorokhod embedding problem, showing they optimize expected values of a broad class of functions involving the process and its maximum, with applications to variance swap pricing.
Contribution
It generalizes the optimality properties of Azéma-Yor and Perkins embeddings to a wider class of functions and explores convergence properties of associated stopping times.
Findings
Azéma-Yor maximizes and Perkins minimizes expected joint functions of process and maximum.
For monotonic functions g, Azéma-Yor minimizes and Perkins maximizes the integral of g over the stopped process.
Results provide model-independent bounds on variance swap prices.
Abstract
The Az\'{e}ma-Yor solution (resp., the Perkins solution) of the Skorokhod embedding problem has the property that it maximizes (resp., minimizes) the law of the maximum of the stopped process. We show that these constructions have a wider property in that they also maximize (and minimize) expected values for a more general class of bivariate functions depending on the joint law of the stopped process and the maximum. Moreover, for monotonic functions , they also maximize and minimize amongst embeddings of , although, perhaps surprisingly, we show that for increasing the Az\'{e}ma-Yor embedding minimizes this quantity, and the Perkins embedding maximizes it. For we show how these results are useful in calculating model independent bounds on the prices of variance swaps. Along the way we also consider…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
