Solving partial-information stochastic parity games
From MaRDI portal
Recommendations
- The complexity of partial-observation stochastic parity games with finite-memory strategies
- Partial-observation stochastic games: how to win when belief fails
- Partial-observation stochastic games, how to win when belief fails
- A survey of partial-observation stochastic parity games
- Partial-observation stochastic reachability and parity games
Cited in
(15)- A survey of partial-observation stochastic parity games
- Qualitative analysis of concurrent mean-payoff games
- Partial-observation stochastic reachability and parity games
- Partial-observation stochastic games: how to win when belief fails
- Graph Games and Reactive Synthesis
- Stable solutions for multiple scenario cost allocation games with partial information
- Strategy Construction for Parity Games with Imperfect Information
- Asynchronous -regular games with partial information
- Qualitative Concurrent Stochastic Games with Imperfect Information
- The frontier of decidability in partially observable recursive games
- Partial-observation stochastic games, how to win when belief fails
- Foundations of Software Science and Computation Structures
- The complexity of partial-observation stochastic parity games with finite-memory strategies
- Positional-player games
- CEGAR for compositional analysis of qualitative properties in Markov decision processes
This page was built for publication: Solving partial-information stochastic parity games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5271071)