Verifying correlated equilibria in concurrent reachability games is P-complete, while subgame-perfect correlated equilibria verification is in log-squared space; the gap vanishes for succinct Bayesian network inputs.
First, we guess a statel inLi that reachesRi with probability0– note that such a state must exist if it is not the case that all states reachRi with probability1
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
-
Verification of Correlated Equilibria in Concurrent Reachability Games
Verifying correlated equilibria in concurrent reachability games is P-complete, while subgame-perfect correlated equilibria verification is in log-squared space; the gap vanishes for succinct Bayesian network inputs.