Permissive Nash and subgame-perfect equilibria with bounded main and retaliation penalties in multiplayer reachability games are decidable in PSPACE under unary-encoded penalty bounds.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Permissive Equilibria in Multiplayer Reachability Games
Permissive Nash and subgame-perfect equilibria with bounded main and retaliation penalties in multiplayer reachability games are decidable in PSPACE under unary-encoded penalty bounds.