Unbounded dynamic programming via the Q-transform
From MaRDI portal
Publication:2138381
DOI10.1016/J.JMATECO.2022.102652zbMATH Open1490.91073arXiv2012.00219OpenAlexW4211248567MaRDI QIDQ2138381FDOQ2138381
Authors: Qingyin Ma, John Stachurski, Alexis Akira Toda 
Publication date: 11 May 2022
Published in: Journal of Mathematical Economics (Search for Journal in Brave)
Abstract: We propose a new approach to solving dynamic decision problems with unbounded rewards based on the transformations used in Q-learning. In our case, the objective of the transform is to convert an unbounded dynamic program into a bounded one. The approach is general enough to handle problems for which existing methods struggle, and yet simple relative to other techniques and accessible for applied work. We show by example that many common decision problems satisfy our conditions.
Full work available at URL: https://arxiv.org/abs/2012.00219
Recommendations
- Discounted dynamic programming with unbounded returns: application to economic models
- scientific article; zbMATH DE number 1536370
- Ordered Solutions for Dynamic Programs
- A simulation-based approach to stochastic dynamic programming
- Finite state approximations for denumerable state infinite horizon discounted Markov decision processes with unbounded rewards
Cites Work
- \({\mathcal Q}\)-learning
- Title not available (Why is that?)
- Title not available (Why is that?)
- Infinite dimensional analysis. A hitchhiker's guide.
- Stochastic finance. An introduction in discrete time
- Correlation inequalities on some partially ordered sets
- Optimal Replacement of GMC Bus Engines: An Empirical Model of Harold Zurcher
- Discrete Dynamic Programming
- Markov decision processes with applications to finance.
- Discounted Dynamic Programming
- Selection and the Evolution of Industry
- Robustness
- Consumption and Portfolio Policies With Incomplete Markets and Short‐Sale Constraints: the Finite‐Dimensional Case1
- Average cost Markov decision processes with weakly continuous transition probabilities
- On discounted dynamic programming with unbounded returns
- Existence and Uniqueness of Solutions to the Bellman Equation in the Unbounded Case
- Dynamic programming with homogeneous functions
- Stochastic optimal growth model with risk sensitive preferences
- Constrained discounted Markov decision processes with Borel state spaces
- Incomplete market dynamics and cross-sectional distributions
- Recursive utility and the Ramsey problem
- The wealth distribution in Bewley economies with capital income risk
- Recursive utility and optimal growth with bounded or unbounded returns
- Berge's theorem for noncompact image sets
- Elementary results on solutions to the Bellman equation of dynamic programming: existence, uniqueness, and convergence
- Markov programming by successive approximations with respect to weighted supremum norms
- Existence and uniqueness of a fixed point for local contractions
- Discounted dynamic programming with unbounded returns: application to economic models
- Take the short route: equilibrium default and debt maturity
- The income fluctuation problem and the evolution of wealth
- An impossibility theorem for wealth in heterogeneous-agent models with limited heterogeneity
- Heterogeneity and persistence in returns to wealth
- Title not available (Why is that?)
- Recursive equilibria in an Aiyagari-style economy with permanent income shocks
- The persistent-transitory representation for earnings processes
- Existence of stationary equilibrium in an incomplete-market model with endogenous labor supply
- Optimal timing of decisions: a general theory based on continuation values
- Title not available (Why is that?)
- A theory of the saving rate of the rich
- Recursive equilibrium in Krusell and Smith (1998)
- Dynamic programming and optimal control. Vol. 1.
- MDPs with setwise continuous transition probabilities
- Very simple Markov-perfect industry dynamics: theory
- Dynamic programming deconstructed: transformations of the Bellman equation and computational efficiency
Cited In (5)
- Dynamic programming deconstructed: transformations of the Bellman equation and computational efficiency
- Do not blame Bellman: it is Koopmans' fault
- Existence and uniqueness of solutions to the Bellman equation in stochastic dynamic programming
- An approximation approach to dynamic programming with unbounded returns
- Fifty years of mathematical growth theory: classical topics and new trends
This page was built for publication: Unbounded dynamic programming via the Q-transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138381)
