IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1906.03309.html
   My bibliography  Save this paper

An optimal transport problem with backward martingale constraints motivated by insider trading

Author

Listed:
  • Dmitry Kramkov
  • Yan Xu

Abstract

We study a single-period optimal transport problem on $\mathbb{R}^2$ with a covariance-type cost function $c(x,y) = (x_1-y_1)(x_2-y_2)$ and a backward martingale constraint. We show that a transport plan $\gamma$ is optimal if and only if there is a maximal monotone set $G$ that supports the $x$-marginal of $\gamma$ and such that $c(x,y) = \min_{z\in G}c(z,y)$ for every $(x,y)$ in the support of $\gamma$. We obtain sharp regularity conditions for the uniqueness of an optimal plan and for its representation in terms of a map. Our study is motivated by a variant of the classical Kyle model of insider trading from Rochet and Vila (1994).

Suggested Citation

  • Dmitry Kramkov & Yan Xu, 2019. "An optimal transport problem with backward martingale constraints motivated by insider trading," Papers 1906.03309, arXiv.org.
  • Handle: RePEc:arx:papers:1906.03309
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. Semyon Malamud & Andreas Schrimpf, 2021. "Persuasion by Dimension Reduction," Swiss Finance Institute Research Paper Series 21-69, Swiss Finance Institute.
    2. Malamud, Semyon & Cieslak, Anna & Schrimpf, Paul, 2021. "Optimal Transport of Information," CEPR Discussion Papers 15859, C.E.P.R. Discussion Papers.
    3. Kerry Back & Francois Cocquemas & Ibrahim Ekren & Abraham Lioui, 2020. "Optimal Transport and Risk Aversion in Kyle's Model of Informed Trading," Papers 2006.09518, arXiv.org, revised Aug 2021.

    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:1906.03309. 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: http://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.