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)