Dynamic Programming and Markov Decision Processes
Steven A. Lippman · The New Palgrave Dictionary of Economics · 1987
A great many problems in economics can be reduced to determining the maximum of a given function. Dynamic programming is one of a number of mathematical optimization techniques applicable in such problems. As will be illustrated, the dynamic programming technique or viewpoint is particularly useful in complex optimization problems with many variables in which time plays a crucial role. Unlike calculus-based techniques it does not require the function being optimized to be differentiable in the (decision) variables. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Cited by 18 works. doi:10.1057/978-1-349-95121-5_80-1
Authors
References
- Dynamic Programming and Markov Processes.
- Discounted Dynamic Programming
- Contraction Mappings in the Theory Underlying Dynamic Programming
- Discrete Dynamic Programming
- Stochastic models in operations research
- The Accumulation of Risky Capital: A Sequential Utility Analysis
- Introduction to Stochastic Dynamic Programming
- Optimal Investment and Consumption Strategies Under Risk for a Class of Utility Functions
- Uncertainty and Optimal Consumption Decisions
- On Dynamic Programming with Unbounded Rewards