IDEAS home Printed from https://ideas.repec.org/a/taf/apmtfi/v11y2004i1p1-25.html
   My bibliography  Save this article

Dynamic programming and mean-variance hedging in discrete time

Author

Listed:
  • Ales Cerny

Abstract

In this paper the general discrete time mean-variance hedging problem is solved by dynamic programming. Thanks to its simple recursive structure the solution is well suited to computer implementation. On the theoretical side, it is shown how the variance-optimal measure arises in the dynamic programming solution and how one can define conditional expectations under this (generally non-equivalent) measure. The result is then related to the results of previous studies in continuous time.

Suggested Citation

  • Ales Cerny, 2004. "Dynamic programming and mean-variance hedging in discrete time," Applied Mathematical Finance, Taylor & Francis Journals, vol. 11(1), pages 1-25.
    • Handle: RePEc:taf:apmtfi:v:11:y:2004:i:1:p:1-25
    DOI: 10.1080/1350486042000196164
    as

    Download full text from publisher

    File URL: http://www.tandfonline.com/doi/abs/10.1080/1350486042000196164
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/1350486042000196164?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 search for a different version of it.

    Citations

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


    Cited by:

    1. Augustyniak, Maciej & Godin, Frédéric & Simard, Clarence, 2019. "A profitable modification to global quadratic hedging," Journal of Economic Dynamics and Control, Elsevier, vol. 104(C), pages 111-131.
    2. Jan Kallsen & Arnd Pauwels, 2011. "Variance-Optimal Hedging for Time-Changed Levy Processes," Applied Mathematical Finance, Taylor & Francis Journals, vol. 18(1), pages 1-28.
    3. Aleš Černý, 2007. "Optimal Continuous‐Time Hedging With Leptokurtic Returns," Mathematical Finance, Wiley Blackwell, vol. 17(2), pages 175-203, April.
    4. Koichi Matsumoto, 2009. "Mean-Variance Hedging with Uncertain Trade Execution," Applied Mathematical Finance, Taylor & Francis Journals, vol. 16(3), pages 219-252.
    5. St'ephane Goutte & Nadia Oudjane & Francesco Russo, 2012. "Variance Optimal Hedging for discrete time processes with independent increments. Application to Electricity Markets," Papers 1205.4089, arXiv.org.
    6. Koichi Matsumoto & Keita Shimizu, 2020. "Hedging Derivatives on Two Assets with Model Risk," Asia-Pacific Financial Markets, Springer;Japanese Association of Financial Economics and Engineering, vol. 27(1), pages 83-95, March.

    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:taf:apmtfi:v:11:y:2004:i:1:p:1-25. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/RAMF20 .

    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.