Strong 1-optimal stationary policies in denumerable Markov decision processes
DOI10.1016/0167-6911(88)90113-2zbMATH Open0654.90097OpenAlexW2038481005MaRDI QIDQ1108940FDOQ1108940
Authors: Rolando Cavazos-Cadena, Jean B. Lasserre 
Publication date: 1988
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6911(88)90113-2
Recommendations
- A note on strong 1-optimal policies in Markov decision chains with unbounded costs
- scientific article; zbMATH DE number 1569429
- scientific article; zbMATH DE number 3847226
- A new strong optimality criterion for nonstationary Markov decision processes
- Optimal Stationary Policies in General State Space Markov Decision Chains with Finite Action Sets
- Optimal stationary policies in the vector-valued Markov decision process
- Pure Stationary Optimal Strategies in Markov Decision Processes
Markov decision processcompact action setscountable state space\(\alpha\)-discounted rewardbounded rewardssimultaneous Doeblin conditionstationary average optimal policystrong 1-optimal policy
Cites Work
- On optimality criteria for dynamic programs with long finite horizons
- Discrete Dynamic Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Average, Sensitive and Blackwell Optimal Policies in Denumerable Markov Decision Chains with Unbounded Rewards
- On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting
- Title not available (Why is that?)
- Necessary and sufficient conditions for a bounded solution to the optimality equation in average reward Markov decision chains
- Discrete Dynamic Programming with a Small Interest Rate
- Conditions for existence of average and Blackwell optimal stationary policies in denumerable Markov decision processes
- Title not available (Why is that?)
Cited In (12)
- Discount-sensitive equilibria in zero-sum stochastic differential games
- Blackwell optimal policies in a Markov decision process with a Borel state space
- Existence of optimal stationary policies in average reward Markov decision processes with a recurrent state
- Another Set of Conditions for Strongn(n = −1, 0) Discount Optimality in Markov Decision Processes
- Remarks on sensitive equilibria in stochastic games with additive reward and transition structure
- A new strong optimality criterion for nonstationary Markov decision processes
- Strong representation theorems for bitone sequential decision processes
- Strong 0-discount optimal policies in a Markov decision process with a Borel state space
- Bias optimality and strong \(n\) \((n= -1,0)\) discount optimality for Markov decision processes
- Polynomial-Time Computation of Strong and n-Present-Value Optimal Policies in Markov Decision Chains
- Are limits of \(\alpha\)-discounted optimal policies Blackwell optimal? A counterexample
- Sample-path optimality and variance-maximization for Markov decision processes
This page was built for publication: Strong 1-optimal stationary policies in denumerable Markov decision processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108940)
