2000 character limit reached
On the monotonicity principle of optimal Skorokhod embedding problem (1506.03413v2)
Published 8 Jun 2015 in math.PR and math.OC
Abstract: In this paper, we provide an alternative proof of the monotonicity principle for the optimal Skorokhod embedding problem established by Beiglb\"ock, Cox and Huesmann. This principle presents a geometric characterization that reflects the desired optimality properties of Skorokhod embeddings. Our proof is based on the adaptation of the Monge-Kantorovich duality in our context together with a delicate application of the optional cross-section theorem and a clever conditioning argument.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.