Stationary Recursive Utility and Dynamic Programming under the Assumption of Biconvergence
This paper introduces the concept of biconvergence, which is a weak and intuitive topological assumption on the utility function and the production function together. Concerning recursive utility, the author shows that, given biconvergence, the utility function is the unique admissible solution to Koopman's equation. Concerning dynamic programming, he shows that, given biconvergence, the true value function exists, it is the unique admissible solution to Bellman's equation, and it may be calculated numerically as the limit of successive approximations. Finally, he develops an overly strong sufficient condition for biconvergence that substantially weakens the Lipschitz condition used by contraction-mapping techniques. Copyright 1990 by The Review of Economic Studies Limited.
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): 57 (1990)
Issue (Month): 1 (January)
|Contact details of provider:|| Web page: http://www.blackwellpublishing.com/journal.asp?ref=0034-6527|
|Order Information:||Web: http://www.blackwellpublishing.com/subs.asp?ref=0034-6527|
When requesting a correction, please mention this item's handle: RePEc:bla:restud:v:57:y:1990:i:1:p:79-97. 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: (Wiley-Blackwell Digital Licensing)or (Christopher F. Baum)
If references are entirely missing, you can add them using this form.