On the monotonicity principle of optimal Skorokhod embedding problem

preprint2016arXivOpen access

Abstract

In this paper, we provide an alternative proof of the monotonicity principle for the optimal Skorokhod embedding problem established by Beiglböck, 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.