Natural strategic ability
DOI10.1016/j.artint.2019.103170zbMath1478.68385OpenAlexW2972087049MaRDI QIDQ2289013
Vadim Malvone, Wojciech Jamroga, Aniello Murano
Publication date: 20 January 2020
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://orbilu.uni.lu/handle/10993/41793
model checkingbounded rationalitymulti-agent systemsconcurrent gamesalternating-time temporal logicstrategic abilityrational verification
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Rationality and learning in game theory (91A26) Temporal logic (03B44) Agent technology and artificial intelligence (68T42)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The virtues of idleness: a decidable fragment of resource agent logic
- Strategy logic
- A logic of strategic ability under bounded memory
- Reasoning about temporal properties of rational play
- From liveness to promptness
- Process logic: Expressiveness, decidability, completeness
- The polynomial-time hierarchy
- Money is memory
- Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications
- Counterexample explanation by learning small strategies in Markov decision processes
- Strategy representation by decision trees in reactive synthesis
- Iterated Boolean games
- Reasoning about memoryless strategies under partial observability and unconditional fairness constraints
- Model-checking for resource-bounded ATL with production and consumption of resources
- Complete axiomatization and decidability of alternating-time temporal logic
- From model checking to equilibrium checking: reactive modules for rational verification
- Model checking abilities of agents: a closer look
- Model checking discounted temporal properties
- A Tool for the Automated Verification of Nash Equilibria in Concurrent Games
- From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity
- On Promptness in Parity Games*†
- Receipt-free secret-ballot elections (extended abstract)
- What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic
- Reasoning about Agent Programs Using ATL-Like Logics
- Reasoning About Strategies
- On the (un-)decidability of model-checking resource-bounded agents
- Verifying agents with memory is harder than it seemed
- Expressing Properties of Resource-Bounded Systems: The Logics RTL * and RTL
- Model Checking Logics of Strategic Ability: Complexity*
- ATL Satisfiability is Indeed EXPTIME-complete
- mcmas: A Model Checker for Multi-agent Systems
- Alternating-time temporal logic
- On the Expressiveness and Complexity of ATL
- ATL* Satisfiability Is 2EXPTIME-Complete
- Timed Concurrent Game Structures
- Stability under Strategy Switching
- ATL with Strategy Contexts and Bounded Memory
- Multiagent Systems
- Constructive knowledge: what agents can achieve under imperfect information
- How Robust Is the Folk Theorem?*
- A Foundation for Markov Equilibria in Sequential Games with Finite Social Memory
- PRISM-games: A Model Checker for Stochastic Multi-Player Games
- Programming Multi-Agent Systems in AgentSpeak usingJason
- CONCUR 2003 - Concurrency Theory
This page was built for publication: Natural strategic ability
