Verification of subgame perfect equilibria in finite-horizon stochastic games lies in PSPACE while Nash equilibrium verification is EXPTIME-complete.
[GV13] Giuseppe De Giacomo and Moshe Y
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Verifying Equilibria in Finite-Horizon Probabilistic Concurrent Game Systems
Verification of subgame perfect equilibria in finite-horizon stochastic games lies in PSPACE while Nash equilibrium verification is EXPTIME-complete.