Skip to main content

A remark on the superhedging theorem under transaction costs

  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Mathematics ((SEMPROBAB,volume 1832))

Abstract

The hedging theorem of [3] describes the initial endowments necessary for the super-replication of a given contingent claim in a model with transaction costs, assuming the continuity of the price process. We demonstrate that this theorem may fail if the price process is discontinuous.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Editor information

Jacques Azéma Michel Émery Michel Ledoux Marc Yor

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Rásonyi, M. (2003). A remark on the superhedging theorem under transaction costs. In: Azéma, J., Émery, M., Ledoux, M., Yor, M. (eds) Séminaire de Probabilités XXXVII. Lecture Notes in Mathematics, vol 1832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40004-2_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-40004-2_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20520-3

  • Online ISBN: 978-3-540-40004-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics