Some notes on discount factor restrictions for dynamic optimization problems
We consider dynamic optimization problems on one-dimensional state spaces. Under standard smoothness and convexity assumptions, the optimal solutions are characterized by an optimal policy function h mapping the state space into itself. There exists an extensive literature on the relation between the size of the discount factor of the dynamic optimization problem on the one hand and the properties of the dynamical system xt+1=h(xt) on the other hand. The purpose of this paper is to survey some of the most important contributions of this literature and to modify or improve them in various directions. We deal in particular with the topological entropy of the dynamical system, with its Lyapunov exponents, and with its periodic orbits.
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.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Sorger, Gerhard, 1995.
"On the sensitivity of optimal growth paths,"
Journal of Mathematical Economics,
Elsevier, vol. 24(4), pages 353-369.
- Montrucchio, Luigi & Sorger, Gerhard, 1996. "Topological entropy of policy functions in concave dynamic optimization models," Journal of Mathematical Economics, Elsevier, vol. 25(2), pages 181-194.
- Medio,Alfredo & Lines,Marji, 2001. "Nonlinear Dynamics," Cambridge Books, Cambridge University Press, number 9780521551861, December.
- Santos, Manuel S, 1991. "Smoothness of the Policy Function in Discrete Time Economic Models," Econometrica, Econometric Society, vol. 59(5), pages 1365-82, September.
- Tapan Mitra & Gerhard Sorger, 1999. "Rationalizing Policy Functions by Dynamic Optimization," Econometrica, Econometric Society, vol. 67(2), pages 375-392, March.
- Nishimura, Kazuo & Yano, Makoto, 1996. "On the Least Upper Bound of Discount Factors That Are Compatible with Optimal Period-Three Cycles," Journal of Economic Theory, Elsevier, vol. 69(2), pages 306-333, May.
- Mitra, Tapan, 1998. "On the relationship between discounting and complicated behavior in dynamic optimization models," Journal of Economic Behavior & Organization, Elsevier, vol. 33(3-4), pages 421-434, January.
- Mitra, Tapan, 1996. "An Exact Discount Factor Restriction for Period-Three Cycles in Dynamic Optimization Models," Journal of Economic Theory, Elsevier, vol. 69(2), pages 281-305, May.
- Medio,Alfredo & Lines,Marji, 2001. "Nonlinear Dynamics," Cambridge Books, Cambridge University Press, number 9780521558747, December.
When requesting a correction, please mention this item's handle: RePEc:eee:mateco:v:45:y:2009:i:7-8:p:435-448. 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: (Shamier, Wendy)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.