Pages that link to "Item:Q2796398"

The following pages link to Recursive Markov Decision Processes and Recursive Stochastic Games (Q2796398):

Displaying 11 items.

• Model-free reinforcement learning for branching Markov decision processes (Q832301) (← links)
• Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (Q1641009) (← links)
• The uniform measure of simple regular sets of infinite trees (Q2029602) (← links)
• A denotational semantics for low-level probabilistic programs with nondeterminism (Q2133180) (← links)
• Recursive stochastic games with positive rewards (Q2422034) (← links)
• (Q5009454) (← links)
• Optimally Resilient Strategies in Pushdown Safety Games (Q5089248) (← links)
• (Q5091277) (← links)
• Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (Q5108256) (← links)
• (Q5129945) (← links)
• Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs (Q5883745) (← links)