Pages that link to "Item:Q3521960"

The following pages link to Recursive Stochastic Games with Positive Rewards (Q3521960):

Displaying 12 items.

• Qualitative reachability in stochastic BPA games (Q719240) (← links)
• Two-player stochastic games. II: The case of recursive games (Q1594890) (← links)
• Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (Q1641009) (← links)
• Recursive stochastic games with positive rewards (Q2422034) (← links)
• Existence and determination of the value and optimal strategies in recursive games (Q2567605) (← links)
• Recursive Markov decision processes and recursive stochastic games (Q2796398) (← links)
• (Q3976306) (← links)
• Recursive Repeated Games with Absorbing States (Q4332264) (← links)
• (Q5091277) (← links)
• Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (Q5108256) (← links)
• Automata, Languages and Programming (Q5716837) (← links)
• Recursive Concurrent Stochastic Games (Q5901535) (← links)