Approximate constrained NE existence in concurrent stopping games is EXPTIME (PSPACE-hard); XRSE constrained existence is NP-complete.
Spirakis , editor =
1 Pith paper cite this work, alongside 3 external citations. Polarity classification is still indexing.
1
Pith paper citing it
3
external citations · OpenAlex
fields
cs.GT 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Algorithms for Equilibria in Concurrent Stopping Games
Approximate constrained NE existence in concurrent stopping games is EXPTIME (PSPACE-hard); XRSE constrained existence is NP-complete.