IDEAS home Printed from https://ideas.repec.org/a/bla/mathfi/v11y2001i3p357-363.html
   My bibliography  Save this article

A Note on the Boyle–Vorst Discrete‐Time Option Pricing Model with Transactions Costs

Author

Listed:
  • Ken Palmer

Abstract

Working in a binomial framework, Boyle and Vorst (1992) derived self‐financing strategies perfectly replicating the final payoffs to long positions in European call and put options, assuming proportional transactions costs on trades in the stocks. The initial cost of such a strategy yields, by an arbitrage argument, an upper bound for the option price. A lower bound for the option price is obtained by replicating a short position. However, for short positions, Boyle and Vorst had to impose three additional conditions. Our aim in this paper is to remove Boyle and Vorst's conditions for the replication of short calls and puts.

Suggested Citation

  • Ken Palmer, 2001. "A Note on the Boyle–Vorst Discrete‐Time Option Pricing Model with Transactions Costs," Mathematical Finance, Wiley Blackwell, vol. 11(3), pages 357-363, July.
    • Handle: RePEc:bla:mathfi:v:11:y:2001:i:3:p:357-363
    DOI: 10.1111/1467-9965.00120
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/1467-9965.00120
    Download Restriction: no
    File URL: https://libkey.io/10.1111/1467-9965.00120?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
    ---><---

    Citations

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


    Cited by:

    1. Barbara Trivellato, 2009. "Replication and shortfall risk in a binomial model with transaction costs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 69(1), pages 1-26, March.
    2. Yuan Hu & Abootaleb Shirvani & W. Brent Lindquist & Frank J. Fabozzi & Svetlozar T. Rachev, 2021. "Market Complete Option Valuation using a Jarrow-Rudd Pricing Tree with Skewness and Kurtosis," Papers 2106.09128, arXiv.org.
    3. Alet Roux & Tomasz Zastawniak, 2016. "Game options with gradual exercise and cancellation under proportional transaction costs," Papers 1612.02312, arXiv.org.
    4. Hu, Yuan & Lindquist, W. Brent & Rachev, Svetlozar T. & Shirvani, Abootaleb & Fabozzi, Frank J., 2022. "Market complete option valuation using a Jarrow-Rudd pricing tree with skewness and kurtosis," Journal of Economic Dynamics and Control, Elsevier, vol. 137(C).

    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:bla:mathfi:v:11:y:2001:i:3:p:357-363. 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: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=0960-1627 .

    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.