On variable discounting in dynamic programming: applications to resource extraction and other economic models
type: Item
instance of: scholarly article
title: On variable discounting in dynamic programming: applications to resource extraction and other economic models
zbMATH Open document ID: 1309.90119
author: Anna Jaskiewicz
author: Janusz Matkowski
author: Andrzej S. Nowak
published in: Annals of Operations Research
publication date: 2014-11-26T00:00:00Z
full work available at URL: MPRA paper 31069.pdf
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 91B16
zbMATH DE Number: 6374170
zbMATH Keywords: dynamic programming
zbMATH Keywords: variable discounting
zbMATH Keywords: Bellman equation
zbMATH Keywords: resource extraction
zbMATH Keywords: growth theory
MaRDI profile type: Publication
OpenAlex ID: W2073842122
cites work: Dynamic programming with homogeneous functions
cites work: Q5722776
cites work: Q3434971
cites work: Discounted Dynamic Programming
cites work: Recursive utility and the Ramsey problem
cites work: Discrete-Time Recursive Utility
cites work: Contraction Mappings in the Theory Underlying Dynamic Programming
cites work: Q4421936
cites work: Q4547438
cites work: Q4255598
cites work: Q5599448
cites work: Persistently Optimal Policies in Stochastic Dynamic Programming with Generalized Discounting
cites work: Stationary Ordinal Utility and Impatience
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: Q4080100
cites work: Existence and Uniqueness of Solutions to the Bellman Equation in the Unbounded Case
cites work: Corrigendum to ``Existence and Uniqueness of Solutions to the Bellman Equation in the Unbounded Case'' Econometrica, Vol. 71, No. 5 (September, 2003), 1519-1555
cites work: Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal
cites work: Q4002751
cites work: Negative Dynamic Programming
DOI: 10.1007/S10479-011-0931-2
description: scientific article; zbMATH DE number 6374170