Pages that link to "Item:Q4133441"
From MaRDI portal
The following pages link to A set of successive approximation methods for discounted Markovian decision problems (Q4133441):
Displayed 16 items.
- (Approximate) iterated successive approximations algorithm for sequential decision processes (Q378751) (← links)
- The numerical exploitation of periodicity in Markov decision processes (Q594776) (← links)
- On theory and algorithms for Markov decision problems with the total reward criterion (Q1144500) (← links)
- The method of value oriented successive approximations for the average reward Markov decision process (Q1144501) (← links)
- Solving linear systems by methods based on a probabilistic interpretation (Q1144900) (← links)
- Action-dependent stopping times and Markov decision process with unbounded rewards (Q1158111) (← links)
- A successive approximation algorithm for an undiscounted Markov decision process (Q1231344) (← links)
- Discounted Markov games: Generalized policy iteration method (Q1236071) (← links)
- Markov programming by successive approximations with respect to weighted supremum norms (Q1236975) (← links)
- A \(K\)-step look-ahead analysis of value iteration algorithms for Markov decision processes (Q1266643) (← links)
- On integral generalized policy iteration for continuous-time linear quadratic regulations (Q2628425) (← links)
- GPI-based design for partially unknown nonlinear two-player zero-sum games (Q2684634) (← links)
- MARKOV DECISION PROCESSES (Q3678995) (← links)
- Improved iterative computation of the expected discounted return in Markov and semi-Markov chains (Q3885559) (← links)
- Optimization of STEOR networks via Markov renewal programming (Q3936527) (← links)
- Adaptive policy-iteration and policy-value-iteration for discounted Markov decision processes (Q3984139) (← links)