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
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.