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.





Describes a project that uses

Uses Software





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)