Recursive Utility and the Rate of Impatience
This paper studies the role of impatience in a model with recursively defined preferences. A method is introduced whereby the rate of impatience can be parametrically adjusted for a given aggregator. Using lattice programming and Topkis' Theorem (1978) sufficient conditions are discovered to guarantee that a reduction in the rate of impatience will lead to greater capital stocks in every period.
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.
Volume (Year): 5 (1995)
Issue (Month): 1 (January)
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00199/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:5:y:1995:i:1:p:51-65. 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: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.