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)