Natural strategic ability
DOI10.1016/J.ARTINT.2019.103170zbMATH Open1478.68385OpenAlexW2972087049MaRDI QIDQ2289013FDOQ2289013
Authors: Wojciech Jamroga, Vadim Malvone, 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
Recommendations
model checkingmulti-agent systemsbounded rationalityconcurrent gamesalternating-time temporal logicstrategic abilityrational verification
Specification and verification (program logics, model checking, etc.) (68Q60) Agent technology and artificial intelligence (68T42) Temporal logic (03B44) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Rationality and learning in game theory (91A26)
Cites Work
- Title not available (Why is that?)
- Programming Multi-Agent Systems in AgentSpeak usingJason
- PRISM-games: a model checker for stochastic multi-player games
- A Tool for the Automated Verification of Nash Equilibria in Concurrent Games
- Title not available (Why is that?)
- Alternating-time temporal logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- A course in game theory.
- Multiagent Systems
- Money is memory
- Title not available (Why is that?)
- How Robust Is the Folk Theorem?*
- Title not available (Why is that?)
- The polynomial-time hierarchy
- Reasoning about agent programs using ATL-like logics
- Reasoning about strategies
- What makes \textsc{Atl}* decidable? A decidable fragment of strategy logic
- Reasoning about strategies: on the model-checking problem
- Reasoning about temporal properties of rational play
- Verifying agents with memory is harder than it seemed
- Iterated Boolean games
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strategy logic
- Succinctness of the complement and intersection of regular expressions
- Receipt-free secret-ballot elections (extended abstract)
- Title not available (Why is that?)
- From liveness to promptness
- Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications
- A foundation for Markov equilibria in sequential games with finite social memory
- Model checking a path (preliminary report)
- Title not available (Why is that?)
- Model checking discounted temporal properties
- Title not available (Why is that?)
- Model-checking for resource-bounded ATL with production and consumption of resources
- On the (un-)decidability of model checking resource-bounded agents
- Expressing properties of resource-bounded systems: the logics RTL\(^{*}\) and RTL
- The virtues of idleness: a decidable fragment of resource agent logic
- Constructive knowledge: what agents can achieve under imperfect information
- From finite automata to regular expressions and back -- a summary on descriptional complexity
- Complete axiomatization and decidability of alternating-time temporal logic
- Title not available (Why is that?)
- Model checking abilities of agents: a closer look
- Model Checking Logics of Strategic Ability: Complexity*
- On the Expressiveness and Complexity of ATL
- Title not available (Why is that?)
- From model checking to equilibrium checking: reactive modules for rational verification
- Timed Concurrent Game Structures
- ATL with Strategy Contexts and Bounded Memory
- A logic of strategic ability under bounded memory
- Reasoning about strategies: on the satisfiability problem
- Title not available (Why is that?)
- Strategy representation by decision trees in reactive synthesis
- ATL Satisfiability is Indeed EXPTIME-complete
- Process logic: Expressiveness, decidability, completeness
- Alternating-time logic with imperfect recall
- On epistemic temporal strategic logic
- mcmas: A Model Checker for Multi-agent Systems
- ATL* Satisfiability Is 2EXPTIME-Complete
- Counterexample explanation by learning small strategies in Markov decision processes
- Reasoning about knowledge and strategies: epistemic strategy logic
- On promptness in parity games
- Imitation in large games
- Stability under strategy switching
- Alternating-time temporal logic with finite-memory strategies
- Making the best of limited memory in multi-player discounted sum games
- Reasoning about memoryless strategies under partial observability and unconditional fairness constraints
- Title not available (Why is that?)
Cited In (5)
Uses Software
This page was built for publication: Natural strategic ability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289013)
