IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v72y2010i3p433-451.html
   My bibliography  Save this article

Optimal partial hedging in a discrete-time market as a knapsack problem

Author

Listed:
  • Peter Lindberg

Abstract

We present a new approach for studying the problem of optimal hedging of a European option in a finite and complete discrete-time market model. We consider partial hedging strategies that maximize the success probability or minimize the expected shortfall under a cost constraint and show that these problems can be treated as so called knapsack problems, which are a widely researched subject in linear programming. This observation gives us better understanding of the problem of optimal hedging in discrete time. Copyright Springer-Verlag 2010

Suggested Citation

  • Peter Lindberg, 2010. "Optimal partial hedging in a discrete-time market as a knapsack problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 72(3), pages 433-451, December.
    • Handle: RePEc:spr:mathme:v:72:y:2010:i:3:p:433-451
    DOI: 10.1007/s00186-010-0327-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-010-0327-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00186-010-0327-0?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.

    References listed on IDEAS

    as
    1. Hans FÃllmer & Peter Leukert, 2000. "Efficient hedging: Cost versus shortfall risk," Finance and Stochastics, Springer, vol. 4(2), pages 117-146.
    2. Gino Favero & Tiziano Vargiolu, 2006. "Shortfall risk minimising strategies in the binomial model: characterisation and convergence," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(2), pages 237-253, October.
    3. George B. Dantzig, 1957. "Discrete-Variable Extremum Problems," Operations Research, INFORMS, vol. 5(2), pages 266-288, April.
    4. Hans FÃllmer & Peter Leukert, 1999. "Quantile hedging," Finance and Stochastics, Springer, vol. 3(3), pages 251-273.
    5. Martello, Silvano & Pisinger, David & Toth, Paolo, 2000. "New trends in exact algorithms for the 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 123(2), pages 325-332, June.
    6. Gino Favero, 2001. "Shortfall risk minimization under model uncertainty in the binomial case: adaptive and robust approaches," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 53(3), pages 493-503, July.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Peter Lindberg, 2012. "Optimal partial hedging of an American option: shifting the focus to the expiration date," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 75(3), pages 221-243, June.
    2. Erdnç Akyildirim & Albert Altarovici, 2016. "Partial hedging and cash requirements in discrete time," Quantitative Finance, Taylor & Francis Journals, vol. 16(6), pages 929-945, June.

    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.
    1. Peter G. Lindberg, 2009. "Optimal partial hedging in a discrete-time market as a knapsack problem," Papers 0910.5101, arXiv.org.
    2. Leitner Johannes, 2005. "Optimal portfolios with expected loss constraints and shortfall risk optimal martingale measures," Statistics & Risk Modeling, De Gruyter, vol. 23(1/2005), pages 49-66, January.
    3. Leitner Johannes, 2007. "Pricing and hedging with globally and instantaneously vanishing risk," Statistics & Risk Modeling, De Gruyter, vol. 25(4/2007), pages 1-22, October.
    4. Sbihi, Abdelkader, 2010. "A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem," European Journal of Operational Research, Elsevier, vol. 202(2), pages 339-346, April.
    5. Melnikov, Alexander & Tong, Shuo, 2014. "Valuation of finance/insurance contracts: Efficient hedging and stochastic interest rates modeling," Risk and Decision Analysis, IOS Press, issue 5, pages 23-41.
    6. Roxana Dumitrescu & Romuald Elie & Wissal Sabbagh & Chao Zhou, 2017. "A new Mertens decomposition of $\mathscr{Y}^{g,\xi}$-submartingale systems. Application to BSDEs with weak constraints at stopping times," Papers 1708.05957, arXiv.org, revised May 2023.
    7. 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.
    8. Mhand Hifi & Hedi Mhalla & Slim Sadfi, 2005. "Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem," Journal of Combinatorial Optimization, Springer, vol. 10(3), pages 239-260, November.
    9. Paola Cappanera & Marco Trubian, 2005. "A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 82-98, February.
    10. Toth, Paolo, 2000. "Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 125(2), pages 222-238, September.
    11. Adrien Nguyen Huu & Nadia Oudjane, 2014. "Hedging Expected Losses on Derivatives in Electricity Futures Markets," Papers 1401.8271, arXiv.org.
    12. Wang, Yumin, 2009. "Quantile hedging for guaranteed minimum death benefits," Insurance: Mathematics and Economics, Elsevier, vol. 45(3), pages 449-458, December.
    13. Wayne King Ming Chan, 2015. "RAROC-Based Contingent Claim Valuation," PhD Thesis, Finance Discipline Group, UTS Business School, University of Technology, Sydney, number 21, July-Dece.
    14. Coleman, Thomas F. & Levchenkov, Dmitriy & Li, Yuying, 2007. "Discrete hedging of American-type options using local risk minimization," Journal of Banking & Finance, Elsevier, vol. 31(11), pages 3398-3419, November.
    15. Bruno Bouchard & Ngoc-Minh Dang, 2013. "Generalized stochastic target problems for pricing and partial hedging under loss constraints—application in optimal book liquidation," Finance and Stochastics, Springer, vol. 17(1), pages 31-72, January.
    16. Joonyup Eun & Chang Sup Sung & Eun-Seok Kim, 2017. "Maximizing total job value on a single machine with job selection," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(9), pages 998-1005, September.
    17. Wishon, Christopher & Villalobos, J. Rene, 2016. "Robust efficiency measures for linear knapsack problem variants," European Journal of Operational Research, Elsevier, vol. 254(2), pages 398-409.
    18. Bruno Bouchard & Jean-François Chassagneux & Géraldine Bouveret, 2016. "A backward dual representation for the quantile hedging of Bermudan options," Post-Print hal-01069270, HAL.
    19. Tomasz Tkalinski, 2014. "Convex hedging of non-superreplicable claims in discrete-time market models," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 79(2), pages 239-252, April.
    20. Melnikov, Alexander & Smirnov, Ivan, 2012. "Dynamic hedging of conditional value-at-risk," Insurance: Mathematics and Economics, Elsevier, vol. 51(1), pages 182-190.

    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:spr:mathme:v:72:y:2010:i:3:p:433-451. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.