Home Dynamic Programming and Mean-Variance Hedging in Discrete Time
Article
Licensed
Unlicensed Requires Authentication

Dynamic Programming and Mean-Variance Hedging in Discrete Time

  • S. Gugushvili
Published/Copyright: March 3, 2010
Become an author with De Gruyter Brill
Georgian Mathematical Journal
From the journal Volume 10 Issue 2

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.

Received: 2002-10-03
Published Online: 2010-03-03
Published in Print: 2003-June

© Heldermann Verlag

Downloaded on 7.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/GMJ.2003.237/pdf
Scroll to top button