Stochastic games with synchronizing objectives
From MaRDI portal
Publication:6649478
DOI10.1145/3531130.3532439MaRDI QIDQ6649478
Publication date: 6 December 2024
2-person games (91A05) Stochastic games, stochastic differential games (91A15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of stochastic \(\omega \)-regular games
- The complexity of two-player games of incomplete information
- On the undecidability of probabilistic planning and related stochastic optimization problems
- Lattice translates of a polytope and the Frobenius problem
- The complexity of synchronizing Markov decision processes
- Controlling a random population
- Distributed synthesis is simply undecidable
- Concurrent reachability games
- Theorie der endlichen und unendlichen Graphen. Kombinatorische Topologie der Streckenkomplexe.
- Programming Discrete Distributions with Chemical Reaction Networks
- Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk).
- Approximate Verification of the Symbolic Dynamics of Markov Chains
- The determinacy of Blackwell games
- Qualitative Determinacy and Decidability of Stochastic Games with Signals
- Distribution-based objectives for Markov Decision Processes
- Probabilistic ω-automata
- Algorithms for Omega-Regular Games with Imperfect Information
This page was built for publication: Stochastic games with synchronizing objectives