Pages that link to "Item:Q4085522"

The following pages link to Bounds and Transformations for Discounted Finite Markov Decision Chains (Q4085522):

Displaying 18 items.

• The numerical exploitation of periodicity in Markov decision processes (Q594776) (← links)
• Generalized polynomial approximations in Markovian decision processes (Q1066821) (← links)
• Approximating Markov decision processes using expected state transitions (Q1075954) (← links)
• Computational comparison of policy iteration algorithms for discounted Markov decision processes (Q1088914) (← links)
• On efficiency of linear programming applied to discounted Markovian decision problems (Q1108203) (← links)
• On theory and algorithms for Markov decision problems with the total reward criterion (Q1144500) (← links)
• Solving linear systems by methods based on a probabilistic interpretation (Q1144900) (← links)
• Markov renewal decision processes with finite horizon (Q1146619) (← links)
• Conditions for characterizing the structure of optimal strategies in infinite-horizon dynamic programs (Q1148824) (← links)
• Action-dependent stopping times and Markov decision process with unbounded rewards (Q1158111) (← links)
• Discounted Markov games; successive approximation and stopping times (Q1240669) (← links)
• A \(K\)-step look-ahead analysis of value iteration algorithms for Markov decision processes (Q1266643) (← links)
• Computational comparison of value iteration algorithms for discounted Markov decision processes (Q1839200) (← links)
• Generic rank-one corrections for value iteration in Markovian decision problems (Q1905071) (← links)
• Error bounds for stochastic shortest path problems (Q2408892) (← links)
• A multi-period TSP with stochastic regular and urgent demands (Q2456410) (← links)
• Block-scaling of value-iteration for discounted Markov renewal programming (Q2638962) (← links)
• Approximate dynamic programming with state aggregation applied to UAV perimeter patrol (Q2903989) (← links)