Dynamic Programming and Mean-Variance Hedging in Discrete Time

Abstract We consider the mean-variance hedging problem in the discrete time setting. Using the dynamic programming approach we obtain recurrent equations for an optimal strategy. Additionally, some technical restrictions of the previous works are removed.

[1]  Huyên Pham,et al.  Dynamic programming and mean-variance hedging , 1999, Finance Stochastics.

[2]  D. Sondermann.  Hedging of non-redundant contingent claims , 1985 .

[3]  D. Sworder.  Stochastic calculus and applications , 1984, IEEE Transactions on Automatic Control.

[4]  Alʹbert Nikolaevich Shiri︠a︡ev,et al.  Statistics of random processes , 1977 .

[5]  Robert J. Elliott,et al.  Stochastic calculus and applications , 1984, IEEE Transactions on Automatic Control.

[6]  Martin Schweizer,et al.  Variance-Optimal Hedging in Discrete Time , 1995, Math. Oper. Res..