Stochastic games with synchronizing objectives

DOI10.1145/3531130.3532439MaRDI QIDQ6649478zbMATH OpenFDO

Authors Laurent Doyen

Publication date 6 December 2024

Full work available at URL https://doi.org/10.1145/3531130.3532439

zbMATH Keywords

complexitysynchronizationdistributionsstochastic games

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) 2-person games (91A05) Stochastic games, stochastic differential games (91A15)

Cites work

• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• scientific article; zbMATH DE number 3371972 (Why is no real title available?)
• A survey of stochastic -regular games
• Algorithms for Omega-Regular Games with Imperfect Information
• Approximate verification of the symbolic dynamics of Markov chains
• Concurrent reachability games
• Controlling a population
• Controlling a random population
• Distributed synthesis is simply undecidable
• Distribution-based objectives for Markov decision processes
• Keeping a crowd safe: on the complexity of parameterized verification (invited talk)
• Lattice translates of a polytope and the Frobenius problem
• On the undecidability of probabilistic planning and related stochastic optimization problems
• Probabilistic ω-automata
• Programming discrete distributions with chemical reaction networks
• Qualitative determinacy and decidability of stochastic games with signals
• The complexity of synchronizing Markov decision processes
• The complexity of two-player games of incomplete information
• The determinacy of Blackwell games
• Theorie der endlichen und unendlichen Graphen. Kombinatorische Topologie der Streckenkomplexe.

This page was built for publication: Stochastic games with synchronizing objectives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649478)