Convex dynamic programming with (bounded) recursive utility
type: Item
instance of: scholarly article
title: Convex dynamic programming with (bounded) recursive utility
zbMATH Open document ID: 1400.91173
author: Gaetano Bloise
author: Yiannis Vailakis
published in: Journal of Economic Theory
publication date: 2018-01-11T00:00:00Z
full work available at URL: 150527.pdf
Mathematics Subject Classification ID: 91B16
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6824346
zbMATH Keywords: recursive utility
zbMATH Keywords: Thompson aggregator
zbMATH Keywords: Bellman operator
MaRDI profile type: Publication
OpenAlex ID: W2766179393
cites work: Q3549441
cites work: Q5386174
cites work: Recursive utility and the Ramsey problem
cites work: Nonexistence of Measurable Optimal Selections
cites work: On dynamic programming with unbounded returns
cites work: Discounting long run average growth in stochastic dynamic programs
cites work: Substitution, Risk Aversion, and the Temporal Behavior of Consumption and Asset Returns: A Theoretical Framework
cites work: Elementary results on solutions to the Bellman equation of dynamic programming: existence, uniqueness, and convergence
cites work: Stationary Ordinal Utility and Impatience
cites work: Stationary Utility and Time Perspective
cites work: Q5732050
cites work: Temporal Resolution of Uncertainty and Dynamic Choice Theory
cites work: Optimal growth models with bounded or unbounded returns: A unifying approach
cites work: Recursive utility and optimal growth with bounded or unbounded returns
cites work: Optimal growth with many consumers
cites work: Unique solutions for stochastic recursive utilities
cites work: Unique Tarski Fixed Points
cites work: Existence and Uniqueness of a Fixed Point for Local Contractions
cites work: Q2946435
cites work: Dynamic programming for non-additive stochastic objectives
cites work: Existence and Uniqueness of Solutions to the Bellman Equation in the Unbounded Case
cites work: Dynamic programming solution of incentive constrained problems
cites work: Q3619682
cites work: Q3630866
cites work: Q4002751
cites work: Stationary Recursive Utility and Dynamic Programming under the Assumption of Biconvergence
cites work: An abstract topological approach to dynamic programming
cites work: Survey of Measurable Selection Theorems
DOI: 10.1016/J.JET.2017.10.008
description: scientific article; zbMATH DE number 6824346