IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2608.27374.html

Distribution-constrained optimal multiple stopping: the Root-type solution

Author

Listed:
  • Shuoqing Deng
  • Daxin Huang

Abstract

We consider the distribution-constrained optimal stopping problem introduced by Bayraktar and Miller (Mathematical Finance, 2019) and Beiglbock et al. (PTRF, 2018). Motivated by the multi-marginal Skorokhod embedding problems (SEP) and applications in mathematical finance, we generalize (a class of) its solution to the multi-marginal case. First, we give a probabilistic characterization of the solution as the first hitting times of barrier sets by some time-reversed process, in the same spirit as Cox et al. (PTRF, 2019). Then, we prove the optimality results using martingale inequality arguments, which extends the type of cost functions considered in Beiglbock et al. (PTRF, 2018).

Suggested Citation

  • Shuoqing Deng & Daxin Huang, 2026. "Distribution-constrained optimal multiple stopping: the Root-type solution," Papers 2608.27374, arXiv.org.
  • Handle: RePEc:arx:papers:2608.27374
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2608.27374
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2608.27374. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.