On computational tractability for rational verification
Rational verification involves checking which temporal logic properties hold of a concurrent/multiagent system, under the assumption that agents in the system choose strategies in game theoretic equilibrium. Rational verification can be understood as a counterpart of model checking for multiagent sy...
المؤلفون الرئيسيون: | Gutierrez, J, Najib, M, Perelli, G, Wooldridge, M |
---|---|
التنسيق: | Conference item |
منشور في: |
International Joint Conferences on Artificial Intelligence
2019
|
مواد مشابهة
-
On the complexity of rational verification
حسب: Gutierrez, J, وآخرون
منشور في: (2022) -
Rational verification: game-theoretic verification of multi-agent systems
حسب: Abate, A, وآخرون
منشور في: (2021) -
Rational verification: from model checking to equilibrium checking
حسب: Wooldridge, M, وآخرون
منشور في: (2016) -
Automated temporal equilibrium analysis: Verification and synthesis of multi-player games
حسب: Gutierrez, J, وآخرون
منشور في: (2020) -
Iterated Boolean games for rational verification
حسب: Gutierrez, J, وآخرون
منشور في: (2017)