How Best to Flip-Flop If You Must: Integer Dynamic Stochastic Programming for Either-Or

Paul A. Samuelson

Journal of Risk and Uncertainty, 1997, vol. 15, issue 3, pages 183-90

Abstract: Standard 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

Date: 1997

Downloads: (external link)
http://journals.kluweronline.com/issn/0895-5646/contents link to full text (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:kap:jrisku:v:15:y:1997:i:3:p:183-90

Access Statistics for this article

Journal of Risk and Uncertainty is edited by W. Kip Viscusi

More articles in Journal of Risk and Uncertainty from Springer
Series data maintained by Christopher F. Baum ().