Shadow martingales -- a stochastic mass transport approach to the peacock problem
arXiv:2006.10478 · doi:10.1214/22-EJP846
Abstract
Given a family of real probability measures increasing in convex order (a peacock) we describe a systematic method to create a martingale exactly fitting the marginals at any time. The key object for our approach is the obstructed shadow of a measure in a peacock, a generalization of the (obstructed) shadow introduced in \cite{BeJu16,NuStTa17}. As input data we take an increasing family of measures with that are submeasures of , called a parametrization of . Then, for any we define an evolution of the measure across our peacock by setting equal to the obstructed shadow of in . We identify conditions on the parametrization such that this construction leads to a unique martingale measure , the shadow martingale, without any assumptions on the peacock. In the case of the left-curtain parametrization we identify the shadow martingale as the unique solution to a continuous-time version of the martingale optimal transport problem. Furthermore, our method enriches the knowledge on the Predictable Representation Property (PRP) since any shadow martingale comes with a canonical Choquet representation in extremal Markov martingales.
Final version