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.
10 Thomas Brihaye, Julie De Pril, and Sven Schewe
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
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.