2000 character limit reached
A measure approximation theorem for Wasserstein-robust expected values (1912.12119v1)
Published 27 Dec 2019 in math.PR and math.OC
Abstract: We consider the problem of finding the infimum, over probability measures being in a ball defined by Wasserstein distance, of the expected value of a bounded Lipschitz random variable on $\mathbf{R}d$. We show that if the $\sigma-$algebra is approximated in by a sequence of $\sigma$-algebras in a certain natural sense, then the solutions of the induced approximated minimization problems converge to that of the initial minimization problem.
Sponsor
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.