IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v237y2026ics0167715226001690.html

Solving the FX cross-smiles problem — rate of convergence for Sinkhorn marginals, and the finite-option case

Author

Listed:
  • Forde, Martin

Abstract

We adapt the arguments in Guyon (2020),Nutz (2022) to the problem of constructing a joint law μ∗ for two FX rates X and Y consistent with observed European option prices on all three cross-rates. The usual Gibbs-type exponential ansatz for μ∗ leads to three coupled integral equations for the Schrödinger potentials u(x), v(y), and yw(xy), and we prove O(1n) convergence for the marginals (in the total variation metric) for the running average of the Sinkhorn iterates, assuming an admissible law exists (typically using ≈50 iterations in practice). The primary application here is risk-neutral pricing of e.g. Basket, Quanto, Best-of or other variations of Rainbow options on X and Y so as to be consistent with all three smiles. We also consider the finite-option case via the usual duality for one-period markets between the (primal) entropy minimization problem over calibrated measures and the (dual) exponential utility maximization problem à la Föllmer&Schied (Föllmer and Schied, 2004).

Suggested Citation

  • Forde, Martin, 2026. "Solving the FX cross-smiles problem — rate of convergence for Sinkhorn marginals, and the finite-option case," Statistics & Probability Letters, Elsevier, vol. 237(C).
  • Handle: RePEc:eee:stapro:v:237:y:2026:i:c:s0167715226001690
    DOI: 10.1016/j.spl.2026.110805
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.spl.2026.110805?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;

    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:eee:stapro:v:237:y:2026:i:c:s0167715226001690. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/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.