Optimal partial hedging in a discrete-time market as a Knapsack problem
From MaRDI portal
Publication:607677
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1971733 (Why is no real title available?)
- Discrete search and the Neyman-Pearson lemma
- Efficient hedging: cost versus shortfall risk
- Explicit solutions for shortfall risk minimization in multinomial models.
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Quantile hedging
- Shortfall risk minimising strategies in the binomial model: characterisation and convergence
- Shortfall risk minimization under model uncertainty in the binomial case: adaptive and robust approaches
- Stochastic finance. An introduction in discrete time
Cited in
(3)
This page was built for publication: Optimal partial hedging in a discrete-time market as a Knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q607677)