Proves exponential memory lower bound for strategy lifting from MDPs to stochastic games and shows linear memory suffices and is necessary for optimal randomized strategies in mean-payoff-parity stochastic games.
18 Rodica Condurache, Emmanuel Filiot, Raffaella Gentilini, and Jean-François Raskin
2 Pith papers cite this work, alongside 71 external citations. Polarity classification is still indexing.
2
Pith papers citing it
71
external citations · OpenAlex
fields
cs.GT 2years
2026 2representative citing papers
Memoryless randomised subgame-perfect equilibria always exist for turn-based deterministic games with reachability, safety, and 0-2 Muller objectives, and can be constructed in polynomial time.
citing papers explorer
-
Mean-Payoff-Parity and Lifting Strategies from MDPs to 2-Player Stochastic Games
Proves exponential memory lower bound for strategy lifting from MDPs to stochastic games and shows linear memory suffices and is necessary for optimal randomized strategies in mean-payoff-parity stochastic games.
-
Simple Nash Equilibria for Qualitative Multiplayer Games
Memoryless randomised subgame-perfect equilibria always exist for turn-based deterministic games with reachability, safety, and 0-2 Muller objectives, and can be constructed in polynomial time.