Convex Hedging in Incomplete Markets

Abstract

In incomplete financial markets not every contingent claim can be replicated by a self-financing strategy. The risk of the resulting shortfall can be measured by convex risk measures, recently introduced by Föllmer, Schied (2002). The dynamic optimization problem of finding a self-financing strategy that minimizes the convex risk of the shortfall can be split into a static optimization problem and a representation problem. It follows that the optimal strategy consists in superhedging the modified claim $\tilde{\phi }H$, where $H$ is the payoff of the claim and $\tilde{\phi }$ is the solution of the static optimization problem, the optimal randomized test. In this paper, we will deduce necessary and sufficient optimality conditions for the static problem using convex duality methods. The solution of the static optimization problem turns out to be a randomized test with a typical $0$-$1$-structure.

Cited by in corpus (7)

• Testing composite hypotheses via convex duality
• Incorporating statistical model error into the calculation of acceptability prices of contingent claims
• Duality formulas for robust pricing and hedging in discrete time
• The Neyman-Pearson lemma for convex expectations
• Outperformance Portfolio Optimization via the Equivalence of Pure and Randomized Hypothesis Testing
• Optimal Dynamic Portfolio with Mean-CVaR Criterion
• A generalized Neyman-Pearson lemma for sublinear expectations