Smooth dynamics and computation in models of economic growth
From MaRDI portal
Publication:5894593
DOI10.1016/0165-1889(94)90036-1zbMath0875.62607MaRDI QIDQ5894593
Publication date: 27 February 1997
Published in: Journal of Economic Dynamics \& Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0165-1889(94)90036-1
62P20: Applications of statistics to economics
49L20: Dynamic programming in optimal control and differential games
91B62: Economic growth models
Related Items
On the smoothness of optimal paths, An envelope theorem and some applications to discounted Markov decision processes
Cites Work
- Determinacy of equilibria in dynamic models with finitely many consumers
- A numerical approach to the infinite horizon problem of deterministic control theory
- Lipschitz continuous policy functions for strongly concave optimization problems
- On the indeterminacy of capital accumulation paths
- Duality theory for dynamic optimization models of economics: The continuous time case
- Smoothness of the policy function in continuous-time economic models. The one-dimensional case
- On the minimum rate of impatience for complicated optimal growth paths
- Differentiability and comparative analysis in discrete-time infinite- horizon optimization
- Optimal control of diffusion processes with reflection
- On optimal growth under uncertainty
- On high-order differentiability of the policy function
- Characterization of optimal plans for stochastic dynamic programs
- On the Structure of Local Homeomorphisms of Euclidean n-Space, II
- On the Differentiability of the Value Function in Dynamic Models of Economics
- Generalized Gradients and Applications
- Smoothness, Comparative Dynamics, and the Turnpike Property
- Asset Prices in an Exchange Economy
- Smoothness of the Policy Function in Discrete Time Economic Models
- The Once But Not Twice Differentiability of the Policy Function
- Period Three Implies Heavy Discounting
- Contraction Mappings in the Theory Underlying Dynamic Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
