How Best to Flip-Flop If You Must: Integer Dynamic Stochastic Programming for Either-Or
AbstractStandard portfolio analysis presumes one can blend different securities continuously. When one must choose all of one portfolio or all of another, we are in stochastic digital programming: either-or, zero-or-one choice. The algorithm for doing this optimally is shown to be simpler than in real variable maximizing, a switch from the usual extra complexities of digital programming. The Bellman multi-period dynamic programming is shown, paradoxically, to make it possible for a risk-averse investor to want sometimes to embrace an unfair gamble. The superiority of within-time diversification over across-time diversification carries over to this flip-flop case. Copyright 1997 by Kluwer Academic Publishers
Download InfoIf 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.
Bibliographic InfoArticle provided by Springer in its journal Journal of Risk and Uncertainty.
Volume (Year): 15 (1997)
Issue (Month): 3 (December)
Contact details of provider:
Web page: http://www.springerlink.com/link.asp?id=100299
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Guenther Eichhorn) or (Christopher F. Baum).
If references are entirely missing, you can add them using this form.