On the minimum rate of impatience for complicated optimal growth paths
From MaRDI portal
Publication:1183701
DOI10.1016/0022-0531(92)90074-RzbMath0751.90022OpenAlexW2009767790MaRDI QIDQ1183701
Publication date: 28 June 1992
Published in: Journal of Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0531(92)90074-r
Related Items
Dynamical systems arising from infinite time horizon optimization models ⋮ Chaotic dynamical systems: An introduction ⋮ Ergodic chaos in optimal growth models with low discount rates ⋮ On the sensitivity of optimal growth paths ⋮ General dynamics in overlapping generations models ⋮ Incomplete-market dynamics in a neoclassical production economy ⋮ Endogenous cycles with small discounting in multisector optimal growth models: Continuous-time case ⋮ Strong concavity properties of indirect utility functions in multisector optimal growth models ⋮ Study of irregular dynamics in an economic model: attractor localization and Lyapunov exponents ⋮ Discounted dynamic optimization and Bregman divergence ⋮ Smooth dynamics and computation in models of economic growth ⋮ The stochastic turnpike property without uniformity in convex aggregate growth models ⋮ Smooth dynamics and computation in models of economic growth ⋮ Wealth inequality, preference heterogeneity and macroeconomic volatility in two-sector economies ⋮ Optimal Cycles and Chaos: A Survey ⋮ Endogenous Cycles in Competitive Models: An Overview ⋮ A uniform neighborhood turnpike theorem and applications ⋮ Dynamic complexity of optimal paths and discount factors for strongly concave problems
Cites Work
- Equilibrium cycling with small discounting
- Sources of complex dynamics in two-sector growth models
- Competitive chaos
- On the indeterminacy of capital accumulation paths
- On the optimality of given feedback controls
- Saddle points of Hamiltonian systems in convex Lagrange problems having a nonzero discount rate
- Saddle points of Hamiltonian systems in convex problems of Lagrange
- A verification theorem which provides a necessary and sufficient condition for optimality
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item