Pages that link to "Item:Q3316991"

The following pages link to Stationary Policies in Dynamic Programming Models Under Compactness Assumptions (Q3316991):

Displaying 17 items.

• Stationary policies and Markov policies in Borel dynamic programming (Q1071658) (← links)
• The existence of good Markov strategies for decision processes with general payoffs (Q1092823) (← links)
• On compactness of the space of policies in stochastic dynamic programming (Q1122507) (← links)
• Comparing recent assumptions for the existence of average optimal stationary policies (Q1198622) (← links)
• Semi-infinite Markov decision processes (Q1974026) (← links)
• Maximizing the probability of visiting a set infinitely often for a countable state space Markov decision process (Q2235986) (← links)
• Non-randomized strategies in stochastic decision processes (Q2638965) (← links)
• A note on the existence of optimal policies in total reward dynamic programs with compact action sets. (Q2757658) (← links)
• Stationary Recursive Utility and Dynamic Programming under the Assumption of Biconvergence (Q3470210) (← links)
• Finite state dynamic programming with the total reward criterion (Q3738957) (← links)
• Existence Without Explicit Compactness in Stochastic Dynamic Programming (Q4022019) (← links)
• The Compactness of a Policy Space in Dynamic Programming Via an Extension Theorem for Carathéodory Functions (Q4346231) (← links)
• A Convex Programming Approach for Discrete-Time Markov Decision Processes under the Expected Total Reward Criterion (Q5130923) (← links)
• On Convergence of Value Iteration for a Class of Total Cost Markov Decision Processes (Q5502179) (← links)
• Optimizing high-dimensional stochastic forestry \textit{via} reinforcement learning (Q6106615) (← links)
• Markov decision processes with risk-sensitive criteria: an overview (Q6540475) (← links)
• Maximizing the probability of visiting a set infinitely often for a Markov decision process with Borel state and action spaces (Q6639538) (← links)