IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v130y2020i2p521-544.html
   My bibliography  Save this article

Minimal Root’s embeddings for general starting and target distributions

Author

Listed:
  • Wang, Jiajie

Abstract

Most results regarding Skorokhod embedding problems SEP so far rely on the assumption that the corresponding stopped process is uniformly integrable, which is equivalent to the convex ordering condition Uμ≤Uν when the underlying process is a local martingale. In this paper, we study the existence, construction of Root’s solutions to SEP, in the absence of this convex ordering condition. We replace the uniform integrability condition by the minimality condition (Monroe, 1972), as the criterion of “good” solutions. A sufficient and necessary condition (in terms of local time) for minimality is given. We also discuss the optimality of such minimal solutions. These results extend the generality of the results given by Cox and Wang (2013) and Gassiat et al. (2015). At last, we extend all the results above to multi-marginal embedding problems based on the work of Cox et al. (2018).

Suggested Citation

  • Wang, Jiajie, 2020. "Minimal Root’s embeddings for general starting and target distributions," Stochastic Processes and their Applications, Elsevier, vol. 130(2), pages 521-544.
  • Handle: RePEc:eee:spapps:v:130:y:2020:i:2:p:521-544
    DOI: 10.1016/j.spa.2019.01.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304414918302291
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.spa.2019.01.009?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gassiat, Paul & Oberhauser, Harald & dos Reis, Gonçalo, 2015. "Root’s barrier, viscosity solutions of obstacle problems and reflected FBSDEs," Stochastic Processes and their Applications, Elsevier, vol. 125(12), pages 4601-4631.
    2. Alexander M. G. Cox & Jiajie Wang, 2011. "Root's barrier: Construction, optimality and applications to variance options," Papers 1104.3583, arXiv.org, revised Mar 2013.
    3. Pedersen, J. L. & Peskir, G., 2001. "The Azéma-Yor embedding in non-singular diffusions," Stochastic Processes and their Applications, Elsevier, vol. 96(2), pages 305-312, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Erhan Bayraktar & Thomas Bernhardt, 2020. "On the Continuity of the Root Barrier," Papers 2010.14695, arXiv.org, revised Jul 2021.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Pierre Henry-Labordère & Nizar Touzi, 2016. "An explicit martingale version of the one-dimensional Brenier theorem," Finance and Stochastics, Springer, vol. 20(3), pages 635-668, July.
    2. Mathias Beiglboeck & Alexander Cox & Martin Huesmann, 2017. "The geometry of multi-marginal Skorokhod Embedding," Papers 1705.09505, arXiv.org.
    3. Guo, Gaoyue & Tan, Xiaolu & Touzi, Nizar, 2017. "Tightness and duality of martingale transport on the Skorokhod space," Stochastic Processes and their Applications, Elsevier, vol. 127(3), pages 927-956.
    4. Henry-Labordère, Pierre & Tan, Xiaolu & Touzi, Nizar, 2016. "An explicit martingale version of the one-dimensional Brenier’s Theorem with full marginals constraint," Stochastic Processes and their Applications, Elsevier, vol. 126(9), pages 2800-2834.
    5. Patrick Cheridito & Michael Kupper & Ludovic Tangpi, 2016. "Duality formulas for robust pricing and hedging in discrete time," Papers 1602.06177, arXiv.org, revised Sep 2017.
    6. Whitmeyer, Mark, 2023. "Submission costs in risk-taking contests," Games and Economic Behavior, Elsevier, vol. 142(C), pages 101-112.
    7. Anna Aksamit & Zhaoxu Hou & Jan Obl'oj, 2016. "Robust framework for quantifying the value of information in pricing and hedging," Papers 1605.02539, arXiv.org, revised Mar 2018.
    8. Cox, Alexander M.G. & Kinsley, Sam M., 2019. "Discretisation and duality of optimal Skorokhod embedding problems," Stochastic Processes and their Applications, Elsevier, vol. 129(7), pages 2376-2405.
    9. Mathias Beiglbock & Marcel Nutz & Florian Stebegg, 2019. "Fine Properties of the Optimal Skorokhod Embedding Problem," Papers 1903.03887, arXiv.org, revised Apr 2020.
    10. Vicky Henderson & David Hobson & Matthew Zeng, 2023. "Cautious stochastic choice, optimal stopping and deliberate randomization," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 75(3), pages 887-922, April.
    11. Cox, A. M. G. & Hobson, D. G., 2004. "An optimal Skorokhod embedding for diffusions," Stochastic Processes and their Applications, Elsevier, vol. 111(1), pages 17-39, May.
    12. Julien Claisse & Gaoyue Guo & Pierre Henry-Labordère, 2018. "Some Results on Skorokhod Embedding and Robust Hedging with Local Time," Journal of Optimization Theory and Applications, Springer, vol. 179(2), pages 569-597, November.
    13. Julien Guyon & Romain Menegaux & Marcel Nutz, 2017. "Bounds for VIX futures given S&P 500 smiles," Finance and Stochastics, Springer, vol. 21(3), pages 593-630, July.
    14. De Angelis, Tiziano & Kitapbayev, Yerkin, 2017. "Integral equations for Rost’s reversed barriers: Existence and uniqueness results," Stochastic Processes and their Applications, Elsevier, vol. 127(10), pages 3447-3464.
    15. Julien Guyon & Romain Menegaux & Marcel Nutz, 2016. "Bounds for VIX Futures given S&P 500 Smiles," Papers 1609.05832, arXiv.org, revised Jun 2017.
    16. Matteo Burzoni & Marco Frittelli & Zhaoxu Hou & Marco Maggis & Jan Obłój, 2019. "Pointwise Arbitrage Pricing Theory in Discrete Time," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 1034-1057, August.
    17. Gaoyue Guo & Jan Obloj, 2017. "Computational Methods for Martingale Optimal Transport problems," Papers 1710.07911, arXiv.org, revised Apr 2019.
    18. Zhaoxu Hou & Jan Obłój, 2018. "Robust pricing–hedging dualities in continuous time," Finance and Stochastics, Springer, vol. 22(3), pages 511-567, July.
    19. Seel, Christian & Strack, Philipp, 2013. "Gambling in contests," Journal of Economic Theory, Elsevier, vol. 148(5), pages 2033-2048.
    20. Gassiat, Paul & Oberhauser, Harald & dos Reis, Gonçalo, 2015. "Root’s barrier, viscosity solutions of obstacle problems and reflected FBSDEs," Stochastic Processes and their Applications, Elsevier, vol. 125(12), pages 4601-4631.

    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:eee:spapps:v:130:y:2020:i:2:p:521-544. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    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.