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...
Autors principals: | Gutierrez, J, Najib, M, Perelli, G, Wooldridge, M |
---|---|
Format: | Journal article |
Idioma: | English |
Publicat: |
Springer
2022
|
Ítems similars
-
On computational tractability for rational verification
per: Gutierrez, J, et al.
Publicat: (2019) -
Rational verification: game-theoretic verification of multi-agent systems
per: Abate, A, et al.
Publicat: (2021) -
Rational verification: from model checking to equilibrium checking
per: Wooldridge, M, et al.
Publicat: (2016) -
Automated temporal equilibrium analysis: Verification and synthesis of multi-player games
per: Gutierrez, J, et al.
Publicat: (2020) -
Iterated Boolean games for rational verification
per: Gutierrez, J, et al.
Publicat: (2017)