On dynamic programming with unbounded returns
From MaRDI portal
Publication:1974599
DOI10.1007/s001990050016zbMath1101.91339OpenAlexW2151487457MaRDI QIDQ1974599
Publication date: 2000
Published in: Economic Theory (Search for Journal in Brave)
Full work available at URL: http://www.cepremap.fr/depot/couv_orange/co9710.pdf
Related Items (21)
Nonzero-sum constrained discrete-time Markov games: the case of unbounded costs ⋮ Recursive utility and optimal growth with bounded or unbounded returns ⋮ Markovian equilibrium in infinite horizon economies with incomplete markets and public policy ⋮ Equilibria in altruistic economic growth models ⋮ An approximation approach to dynamic programming with unbounded returns ⋮ Convex dynamic programming with (bounded) recursive utility ⋮ Stochastic optimal growth model with risk sensitive preferences ⋮ Optimal solutions to the infinite horizon problems: constructing the optimum as the limit of the solutions for the finite horizon problems ⋮ Discounted dynamic programming with unbounded returns: application to economic models ⋮ On recursive utilities with non-affine aggregator and conditional certainty equivalent ⋮ Unique solutions for stochastic recursive utilities ⋮ Limit of the solutions for the finite horizon problems as the optimal solution to the infinite horizon optimization problems ⋮ Elementary results on solutions to the Bellman equation of dynamic programming: existence, uniqueness, and convergence ⋮ Stochastic games with unbounded payoffs: applications to robust control in economics ⋮ Introduction to a general equilibrium approach to economic growth ⋮ Optimal growth models with bounded or unbounded returns: A unifying approach ⋮ Generalised discounting in dynamic programming with unbounded returns ⋮ Unnamed Item ⋮ On temporal aggregators and dynamic programming ⋮ Infinite-horizon deterministic dynamic programming in discrete time: a monotone convergence principle and a penalty method ⋮ On maximin dynamic programming and the rate of discount
This page was built for publication: On dynamic programming with unbounded returns
