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
view it first. In case of further problems read
the IDEAS help
. 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.
Article provided by Taylor and Francis Journals in its journal Applied Mathematical Finance
Volume (Year): 11 (2004)Handle:
Issue (Month): 1 ()
Contact details of provider:
Web page: http://taylorandfrancis.metapress.com/link.asp?target=journal&id=100141
Related researchKeywords: mean-variance hedging
; discrete time
; dynamic programming
; incomplete market
ReferencesNo references listed on IDEAS
You can help add them by filling out this form
This item is not listed on Wikipedia, on a reading list
or among the top items
StatisticsAccess and download statistics
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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.