Maximizing functionals of the maximum in the Skorokhod embedding problem and an application to variance swaps

The Azé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 F(W.,S.) depending on the joint law of the stopped process and the maximum. Moreover, for monotonic functions g, they also maximize and minimize E[..0g(St)dt] amongst embeddings of ., although, perhaps surprisingly, we show that for increasing g the Azéma.Yor embedding minimizes this quantity, and the Perkins embedding maximizes it. For g(s)=s.2 we show how these results are useful in calculating model independent bounds on the prices of variance swaps. Along the way we also consider whether .n converges weakly to . is a sufficient condition for the associated Azéma.Yor and Perkins stopping times to converge. In the case of the Azéma.Yor embedding, if the potentials at zero also converge, then the stopping times converge almost surely, but for the Perkins embedding this need not be the case. However, under a further condition on the convergence of atoms at zero, the Perkins stopping times converge in probability (and hence converge almost surely down a subsequence).