Easy Affine Markov Decision Processes
From MaRDI portal
Publication:5129219
DOI10.1287/opre.2018.1836zbMath1455.90146OpenAlexW2611140247WikidataQ126984900 ScholiaQ126984900MaRDI QIDQ5129219
Publication date: 26 October 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2018.1836
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal escapement in stage-structured fisheries with environmental stochasticity
- A priori bounds for approximations of Markov programs
- Stochastic optimal control. The discrete time case
- Multi-factor dynamic investment under uncertainty
- Approximate stochastic dynamic programming for hydroelectric production planning
- Introduction to stochastic control theory
- Economics of harvesting age-structured fish populations
- Integrated Optimization of Procurement, Processing, and Trade of Commodities
- Introduction to Stochastic Programming
- Dynamic Programming Under Uncertainty with a Quadratic Criterion Function
- A Note on Certainty Equivalence in Dynamic Planning
- Affine Structure and Invariant Policies for Dynamic Programs
- Policy Bounds for Markov Decision Processes
- Optimum Age-Specific Harvesting in a Nonlinear Population Model
- Myopic Solutions of Markov Decision Processes and Stochastic Games
- An Iterative Aggregation Procedure for Markov Decision Processes
- Approximations of Dynamic Programs, I
- Approximations of Dynamic Programs, II
- Numerical Solution of Continuous-State Dynamic Programs Using Linear and Spline Interpolation
- Myopic Solutions of Affine Dynamic Models
- Approximate Dynamic Programming
- Computing Optimal (s, S) Inventory Policies
- Optimal Policy for a Multi-Product, Dynamic, Nonstationary Inventory Problem
- Higher-Order and Average Reward Myopic-Affine Dynamic Models
This page was built for publication: Easy Affine Markov Decision Processes
