Pages that link to "Item:Q1250794"

The following pages link to Contraction mappings underlying undiscounted Markov decision problems (Q1250794):

Displaying 14 items.

• Denumerable state nonhomogeneous Markov decision processes (Q805501) (← links)
• Finite state approximation algorithms for average cost denumerable state Markov decision processes (Q1066819) (← links)
• A unified approach to adaptive control of average reward Markov decision processes (Q1095048) (← links)
• Contraction mappings underlying undiscounted Markov decision problems. II (Q1101358) (← links)
• A Brouwer fixed-point mapping approach to communicating Markov decision processes (Q1115361) (← links)
• Nonstationary Markov decision problems with converging parameters (Q1136706) (← links)
• Conditions for characterizing the structure of optimal strategies in infinite-horizon dynamic programs (Q1148824) (← links)
• Illustrated review of convergence conditions of the value iteration algorithm and the rolling horizon procedure for average-cost MDPs (Q1761758) (← links)
• A survey of algorithmic methods for partially observed Markov decision processes (Q2638960) (← links)
• Iterative algorithms for solving undiscounted bellman equations (Q3032902) (← links)
• A Fixed Point Approach to Undiscounted Markov Renewal Programs (Q3347663) (← links)
• Improved iterative computation of the expected discounted return in Markov and semi-Markov chains (Q3885559) (← links)
• (Q3971601) (← links)
• Stationary equilibria in cyclic games: search and structure (Q5942064) (← links)