On the complexity of rational verification
Rational verification refers to the problem of checking which temporal logic properties hold of a concurrent/multiagent system, under the assumption that agents in the system choose strategies that form a game theoretic equilibrium. Rational verification can be understood as a counterpart to model c...
मुख्य लेखकों: | Gutierrez, J, Najib, M, Perelli, G, Wooldridge, M |
---|---|
स्वरूप: | Journal article |
भाषा: | English |
प्रकाशित: |
Springer
2022
|
समान संसाधन
-
On computational tractability for rational verification
द्वारा: Gutierrez, J, और अन्य
प्रकाशित: (2019) -
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)