Minimum impatience theorems for recursive economic models

zbMath0787.90012MaRDI QIDQ1311454

Gerhard Sorger

Publication date: 21 December 1993

Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)

zbMATH Keywords

complexitychaosnonlinear dynamicdeterministic dynamic programminginverse optimal growthminimum impatience theorems

Mathematics Subject Classification ID

Economic growth models (91B62)

Related Items (17)

Dynamical systems arising from infinite time horizon optimization models ⋮ Ergodic chaos in optimal growth models with low discount rates ⋮ On the structure of Ramsey equilibrium: Cycles, indeterminacy, and sunspots ⋮ On the sensitivity of optimal growth paths ⋮ Balanced-growth-consistent recursive utility ⋮ 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 ⋮ Discounted dynamic optimization and Bregman divergence ⋮ On the probability of chaos in large dynamical systems: a Monte Carlo study. ⋮ Chaos Theory in Operations Research ⋮ Impatience and dynamic optimal behavior: a bifurcation analysis of the Robinson-Solow-Srinivasan model ⋮ The present value of resources with large discount rates ⋮ Discounting and long-run behavior: Global bifurcation analysis of a family of dynamical systems ⋮ Topological entropy of policy functions in concave dynamic optimization models ⋮ Neighborhood turnpike theorem for continuous-time optimization models ⋮ Chaos in nonlinear dynamical systems exemplified by an R\& D model ⋮ Optimal growth under discounting in the two-sector Robinson–Solow–Srinivasan model: a dynamic programming approach†

This page was built for publication: Minimum impatience theorems for recursive economic models