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.
Title resolution pending
1 Pith paper cite this work, alongside 8 external citations. Polarity classification is still indexing.
1
Pith paper citing it
8
external citations · OpenAlex
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.