Pages that link to "Item:Q3012931"
From MaRDI portal
The following pages link to Approximating the Termination Value of One-Counter MDPs and Stochastic Games (Q3012931):
Displaying 6 items.
- Determinacy and optimal strategies in infinite-state stochastic reachability games (Q391114) (← links)
- Analyzing probabilistic pushdown automata (Q2248071) (← links)
- Deciding Fast Termination for Probabilistic VASS with Nondeterminism (Q3297606) (← links)
- A Survey of Bidding Games on Graphs (Invited Paper) (Q5089263) (← links)
- Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (Q5108256) (← links)
- Infinite-Duration Bidding Games (Q5111634) (← links)