On maximin dynamic programming and the rate of discount
From MaRDI portal
Publication:2323610
DOI10.1007/S00199-018-1166-0zbMath1422.91494OpenAlexW2905441226WikidataQ128746369 ScholiaQ128746369MaRDI QIDQ2323610
Jean-Pierre Drugeon, Thi Do Hanh Nguyen, Thai Ha-Huy
Publication date: 3 September 2019
Published in: Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00199-018-1166-0
Related Items (5)
A tale of two Rawlsian criteria ⋮ Optimality in an OLG model with nonsmooth preferences ⋮ On recursive utilities with non-affine aggregator and conditional certainty equivalent ⋮ Monetary rules in a two-sector endogenous growth model ⋮ Saving and dissaving under Ramsey-Rawls criterion
Cites Work
- Unnamed Item
- Unnamed Item
- On variable discounting in dynamic programming: applications to resource extraction and other economic models
- Designing a strategyproof spot market mechanism with many traders: twenty-two steps to Walrasian equilibrium
- Optimal growth models with bounded or unbounded returns: A unifying approach
- Maxmin expected utility with non-unique prior
- An abstract topological approach to dynamic programming
- Dynamic programming with homogeneous functions
- Sensitivity analysis of multisector optimal economic dynamics
- Discounting and optimizing: Capital accumulation problems as variational minmax problems
- On dynamic programming with unbounded returns
- A not so myopic axiomatization of discounting
- Elementary results on solutions to the Bellman equation of dynamic programming: existence, uniqueness, and convergence
- Recursive utility with unbounded aggregators
- Recursive utility and optimal growth with bounded or unbounded returns
- Stationary Recursive Utility and Dynamic Programming under the Assumption of Biconvergence
- Minimizing a Submodular Function on a Lattice
- On Multiple Discount Rates
- A Model of Utility Smoothing
- Existence and Uniqueness of Solutions to the Bellman Equation in the Unbounded Case
This page was built for publication: On maximin dynamic programming and the rate of discount
