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

Quantum Bounds for Option Prices

Author

Listed:
  • Paul McCloud

Abstract

Option pricing is the most elemental challenge of mathematical finance. Knowledge of the prices of options at every strike is equivalent to knowing the entire pricing distribution for a security, as derivatives contingent on the security can be replicated using options. The available data may be insufficient to determine this distribution precisely, however, and the question arises: What are the bounds for the option price at a specified strike, given the market-implied constraints? Positivity of the price map imposed by the principle of no-arbitrage is here utilised, via the Gelfand-Naimark-Segal construction, to transform the problem into the domain of operator algebras. Optimisation in this larger context is essentially geometric, and the outcome is simultaneously super-optimal for all commutative subalgebras. This generates an upper bound for the price of a basket option. With innovative decomposition of the assets in the basket, the result is used to create converging families of price bounds for vanilla options, interpolate the volatility smile, price options on cross FX rates, and analyse the relationships between swaption and caplet prices.

Suggested Citation

  • Paul McCloud, 2017. "Quantum Bounds for Option Prices," Papers 1712.01385, arXiv.org, revised May 2018.
    • Handle: RePEc:arx:papers:1712.01385
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Paul McCloud, 2017. "Information and Arbitrage: Applications of Quantum Groups in Mathematical Finance," Papers 1711.07279, arXiv.org, revised Feb 2024.
    Full references (including those not matched with items on IDEAS)

    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.

      More about this item

      NEP fields

      This paper has been announced in the following NEP Reports:

      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:1712.01385. 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: 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.