Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 167 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 33 tok/s Pro
GPT-5 High 40 tok/s Pro
GPT-4o 92 tok/s Pro
Kimi K2 193 tok/s Pro
GPT OSS 120B 425 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

PDE Methods For Optimal Skorokhod Embeddings (1807.10347v3)

Published 26 Jul 2018 in math.AP

Abstract: We consider cost minimizing stopping time solutions to Skorokhod embedding problems, which deal with transporting a source probability measure to a given target measure through a stopped Brownian process. PDEs and a free boundary problem approach are used to address the problem in general dimensions with space-time inhomogeneous costs given by Lagrangian integrals along the paths. We introduce an Eulerian---mass flow---formulation of the problem, whose dual is given by Hamilton-Jacobi-Bellman type variational inequalities. Our key result is the existence (in a Sobolev class) of optimizers for this new dual problem, which in turn determines a free boundary, where the optimal Skorokhod transport drops the mass in space-time. This complements and provides a constructive PDE alternative to recent results of Beiglb\"ock, Cox, and Huesmann, and is a first step towards developing a general optimal mass transport theory involving mean field interactions and noise.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.