Cover Image

Algorithm and Strategy Construction for Sure-Almost-Sure Stochastic Parity Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Doyen, Laurent, Guha, Shibashis
Format:	Preprint
Published:	2026
Subjects:	Computer Science and Game Theory Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Sure-almost-sure and Sure-limit-sure Window Mean Payoff in Markov Decision Processes
by: Gaba, Pranshu, et al.
Published: (2026)

Stochastic Window Mean-Payoff Games
by: Doyen, Laurent, et al.
Published: (2023)

Expectation in Stochastic Games with Prefix-independent Objectives
by: Doyen, Laurent, et al.
Published: (2024)

Regular Games with Imperfect Information Are Not That Regular
by: Doyen, Laurent, et al.
Published: (2024)

Benchmarks for Parity Games (extended version)
by: Keiren, Jeroen J. A.
Published: (2014)

Memoryless Strategies in Stochastic Reachability Games
by: Kiefer, Stefan, et al.
Published: (2024)

Markov Decision Processes with Sure Parity and Multiple Reachability Objectives
by: Berthon, Raphaël, et al.
Published: (2024)

Strategy Templates for Almost-Sure and Positive Winning of Stochastic Parity Games towards Permissive and Resilient Control
by: Phalakarn, Kittiphon, et al.
Published: (2024)

Polytopal Stochastic Games
by: Castro, Pablo F., et al.
Published: (2025)

Concurrent Strategies on Games with Algebras
by: Huriot-Tattegrain, Sacha, et al.
Published: (2024)

Computational Modelling for Combinatorial Game Strategies
by: Diaconescu, Răzvan
Published: (2024)

Strategy Synthesis for Zero-Sum Neuro-Symbolic Concurrent Stochastic Games
by: Yan, Rui, et al.
Published: (2022)

Optimising expectation with guarantees for window mean payoff in Markov decision processes
by: Gaba, Pranshu, et al.
Published: (2025)

A Game of Pawns
by: Avni, Guy, et al.
Published: (2023)

Sound Value Iteration for Simple Stochastic Games
by: Azeem, Muqsit, et al.
Published: (2024)

Temporal Explorability Games
by: Austin, Pete, et al.
Published: (2024)

The Complexity of Games with Randomised Control
by: Bahmani, Sarvin, et al.
Published: (2026)

Antichains for Concurrent Parameterized Games
by: Bertrand, Nathalie, et al.
Published: (2025)

Generalised Reachability Games Revisited
by: Bose, Sougata, et al.
Published: (2025)

Games with $ω$-Automatic Preference Relations
by: Bruyère, Véronique, et al.
Published: (2025)

Faster Game Solving by Fixpoint Acceleration
by: Hausmann, Daniel
Published: (2024)

Scaling CheckMate for Game-Theoretic Security
by: Rain, Sophie, et al.
Published: (2024)

Verifying Equilibria in Finite-Horizon Probabilistic Concurrent Game Systems
by: Rajasekaran, Senthil, et al.
Published: (2025)

Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime
by: Nayak, Satya Prakash, et al.
Published: (2022)

Resilient Strategies for Stochastic Systems: How Much Does It Take to Break a Winning Strategy?
by: Grover, Kush, et al.
Published: (2026)

Arena-Independent Finite-Memory Determinacy in Stochastic Games
by: Bouyer, Patricia, et al.
Published: (2021)

Games on Graphs: From Logic and Automata to Algorithms
by: Fijalkow, Nathanaël, et al.
Published: (2023)

Positive Almost-Sure Termination of Polynomial Random Walks
by: Winkler, Lorenz, et al.
Published: (2025)

Compositional Verification of Almost-Sure Büchi Objectives in MDPs
by: van der Vegt, Marck, et al.
Published: (2025)

Robust Almost-Sure Reachability in Multi-Environment MDPs
by: van der Vegt, Marck, et al.
Published: (2023)

A PSPACE Algorithm for Almost-Sure Rabin Objectives in Multi-Environment MDPs
by: Suilen, Marnix, et al.
Published: (2024)

Almost-Sure Termination by Guarded Refinement
by: Gregersen, Simon Oddershede, et al.
Published: (2024)

Concurrent Stochastic Games with Stateful-discounted and Parity Objectives: Complexity and Algorithms
by: Asadi, Ali, et al.
Published: (2024)

Attractors Is All You Need: Parity Games In Polynomial Time
by: van der Heijden, Rick
Published: (2025)

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2023)

A Direct Reduction from Stochastic Parity Games to Simple Stochastic Games
by: Berthon, Raphaël, et al.
Published: (2025)

Dicey Games: Shared Sources of Randomness in Distributed Systems
by: Brice, Léonard, et al.
Published: (2026)

Designing Equilibria in Concurrent Games with Social Welfare and Temporal Logic Constraints
by: Gutierrez, Julian, et al.
Published: (2023)

Almost Surely Asymptotically Constant Graph Neural Networks
by: Adam-Day, Sam, et al.
Published: (2024)

Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)