Showing cs.GTShow all
3 papers · 1 filter
cs.GT2026
Positional Determinacy with Colored Vertices: a 1-to-2-Player Lift
Raphaël Berthon, Stéphane Le Roux
Positional determinacy of vertex-colored parity games was proved in the 1990s, which directly implies positional determinacy of edge-colored parity games. In 2006, it was shown tha…
cs.GT2025
A Direct Reduction from Stochastic Parity Games to Simple Stochastic Games
Raphaël Berthon, Joost-Pieter Katoen, Zihan Zhou
Significant progress has been recently achieved in developing efficient solutions for simple stochastic games (SSGs), focusing on reachability objectives. While reductions from sto…
cs.GT2024
Markov Decision Processes with Sure Parity and Multiple Reachability Objectives
Raphaël Berthon, Joost-Pieter Katoen, Tobias Winkler
This paper considers the problem of finding strategies that satisfy a mixture of sure and threshold objectives in Markov decision processes. We focus on a single -regular objec…