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

Model-independent upper bounds for the prices of Bermudan options with convex payoffs

Author

Listed:
  • David Hobson
  • Dominykas Norgilas

Abstract

Suppose $\mu$ and $\nu$ are probability measures on $\mathbb R$ satisfying $\mu \leq_{cx} \nu$. Let $a$ and $b$ be convex functions on $\mathbb R$ with $a \geq b \geq 0$. We are interested in finding \[ \sup_{\mathcal M} \sup_{\tau} \mathbb{E}^{\mathcal M} \left[ a(X) I_{ \{ \tau = 1 \} } + b(Y) I_{ \{ \tau = 2 \} } \right] \] where the first supremum is taken over consistent models $\mathcal M$ (i.e., filtered probability spaces $(\Omega, \mathcal F, \mathbb F, \mathbb P)$) such that $Z=(z,Z_1,Z_2)=(\int_{\mathbb R} x \mu(dx) = \int_{\mathbb R} y \nu(dy), X, Y)$ is a $(\mathbb F,\mathbb P)$ martingale, where $X$ has law $\mu$ and $Y$ has law $\nu$ under $\mathbb P$) and $\tau$ in the second supremum is a $(\mathbb F,\mathbb P)$-stopping time taking values in $\{1,2\}$. Our contributions are first to characterise and simplify the dual problem, and second to completely solve the problem in the symmetric case under the dispersion assumption. A key finding is that the canonical set-up in which the filtration is that generated by $Z$ is not rich enough to define an optimal model and additional randomisation is required. This holds even though the marginal laws $\mu$ and $\nu$ are atom-free. The problem has an interpretation of finding the robust, or model-free, no-arbitrage bound on the price of a Bermudan option with two possible exercise dates, given the prices of co-maturing European options.

Suggested Citation

  • David Hobson & Dominykas Norgilas, 2025. "Model-independent upper bounds for the prices of Bermudan options with convex payoffs," Papers 2503.13328, arXiv.org, revised Mar 2025.
  • Handle: RePEc:arx:papers:2503.13328
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2503.13328
    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:2503.13328. 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.