Dynamic programming and mean-variance hedging in discrete time
In this paper the general discrete time mean-variance hedging problem is solved by dynamic programming. Thanks to its simple recursive structure the solution is well suited to computer implementation. On the theoretical side, it is shown how the variance-optimal measure arises in the dynamic programming solution and how one can define conditional expectations under this (generally non-equivalent) measure. The result is then related to the results of previous studies in continuous time.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 11 (2004)
Issue (Month): 1 ()
|Contact details of provider:|| Web page: http://www.tandfonline.com/RAMF20|
|Order Information:||Web: http://www.tandfonline.com/pricing/journal/RAMF20|
When requesting a correction, please mention this item's handle: RePEc:taf:apmtfi:v:11:y:2004:i:1:p:1-25. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Michael McNulty)
If references are entirely missing, you can add them using this form.