Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed rational decision making
Multiagent systems
On the NP-completeness of finding an optimal strategy in games with common payoffs
International Journal of Game Theory
Tractable multiagent planning for epistemic goals
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Alternating-time temporal logic
Journal of the ACM (JACM)
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A modal characterization of Nash equilibrium
Fundamenta Informaticae
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
A knowledge-based framework for belief change part I: foundations
TARK '94 Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge
A computationally grounded logic of knowledge, belief and certainty
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
A logic for strategic reasoning
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Knowing how to play: uniform choices in logics of agency
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
What agents can achieve under incomplete information
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Alternating-time temporal logics with irrevocable strategies
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
A framework for reasoning about rational agents
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Agents, beliefs, and plausible behavior in a temporal setting
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Model Checking Abilities of Agents: A Closer Look
Theory of Computing Systems
Intentions and strategies in game-like scenarios
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
An Argumentative Approach for Modelling Coalitions Using ATL
Argumentation in Multi-Agent Systems
Rational play and rational beliefs under uncertainty
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
On the (Un-)Decidability of Model Checking Resource-Bounded Agents
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Verifying normative behaviour via normative mechanism design
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Specification and verification of multi-agent systems
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
This article is about defining a suitable logic for expressing classical game theoretical notions. We define an extension of alternating-time temporal logic (ATL) that enables us to express various rationality assumptions of intelligent agents. Our proposal, the logic ATLP (ATL with plausibility) allows us to specify sets of rational strategy profiles in the object language, and reason about agents' play if only these strategy profiles were allowed. For example, we may assume the agents to play only Nash equilibria, Pareto-optimal profiles or undominated strategies, and ask about the resulting behaviour (and outcomes) under such an assumption. The logic also gives rise to generalized versions of classical solution concepts through characterizing patterns of payoffs by suitably parameterized formulae of ATLP. We investigate the complexity of model checking ATLP for several classes of formulae: It ranges from $\Delta_{\mathbf{3}}^{\mathbf{P}}$ to PSPACE in the general case and from $\Delta_{\mathbf{3}}^{\mathbf{P}}$ to $\Delta_{\mathbf{4}}^{\mathbf{P}}$ for the most interesting subclasses, and roughly corresponds to solving extensive games with imperfect information.