A novel circuit-based model for multi-agent systems yields complexity bounds on realizability and verification that address endemic issues in the explicit model and equilibrium analysis literature.
Prism-games 3.0: Stochastic game verification with concurrency, equilibria and time
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.GT 2verdicts
UNVERDICTED 2representative citing papers
Verification of subgame perfect equilibria in finite-horizon stochastic games lies in PSPACE while Nash equilibrium verification is EXPTIME-complete.
citing papers explorer
-
Modeling Concurrent Multi-Agent Systems
A novel circuit-based model for multi-agent systems yields complexity bounds on realizability and verification that address endemic issues in the explicit model and equilibrium analysis literature.