On dynamic programming with unbounded returns
Some economic models like those of endogenous growth motivate the analysis of a class of recursive models sharing the property that the return function is not bounded along feasible paths. We consider a strategy of proof which allows to deal with many unbounded recursive models exploiting bounds to the rates of growth rather than to the levels.
(This abstract was borrowed from another version of this item.)
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||1997|
|Date of revision:|
|Contact details of provider:|| Postal: 48 boulevard Jourdan - 75014 PARIS|
Phone: +33(0) 1 43 13 62 30
Fax: +33(0) 1 43 13 62 32
Web page: http://www.cepremap.fr/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:cpm:cepmap:9710. 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: (Stéphane Adjemian)
If references are entirely missing, you can add them using this form.