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...
| मुख्य लेखकों: | , , , |
|---|---|
| स्वरूप: | Conference item |
| प्रकाशित: |
International Joint Conferences on Artificial Intelligence
2019
|