alternating-time temporal logicbounded rationalityconcurrent gamesmodel checkingmulti-agent systemsrational verificationstrategic ability
Temporal logic (03B44) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Agent technology and artificial intelligence (68T42) Rationality and learning in game theory (91A26)
Recommendations
Cites work
- A course in game theory.
- A foundation for Markov equilibria in sequential games with finite social memory
- A logic of strategic ability under bounded memory
- A Tool for the Automated Verification of Nash Equilibria in Concurrent Games
- Alternating-time logic with imperfect recall
- Alternating-time temporal logic
- Alternating-time temporal logic with finite-memory strategies
- ATL Satisfiability is Indeed EXPTIME-complete
- ATL with Strategy Contexts and Bounded Memory
- ATL* Satisfiability Is 2EXPTIME-Complete
- Complete axiomatization and decidability of alternating-time temporal logic
- Constructive knowledge: what agents can achieve under imperfect information
- Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications
- Counterexample explanation by learning small strategies in Markov decision processes
- Expressing properties of resource-bounded systems: the logics RTL\(^{*}\) and RTL
- From finite automata to regular expressions and back -- a summary on descriptional complexity
- From liveness to promptness
- From model checking to equilibrium checking: reactive modules for rational verification
- How Robust Is the Folk Theorem?*
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3757688 (Why is no real title available?)
- scientific article; zbMATH DE number 465669 (Why is no real title available?)
- scientific article; zbMATH DE number 2080355 (Why is no real title available?)
- scientific article; zbMATH DE number 2182496 (Why is no real title available?)
- scientific article; zbMATH DE number 2182497 (Why is no real title available?)
- scientific article; zbMATH DE number 2087806 (Why is no real title available?)
- scientific article; zbMATH DE number 783783 (Why is no real title available?)
- scientific article; zbMATH DE number 7297884 (Why is no real title available?)
- scientific article; zbMATH DE number 5593264 (Why is no real title available?)
- scientific article; zbMATH DE number 2196601 (Why is no real title available?)
- scientific article; zbMATH DE number 2201583 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- Imitation in large games
- Iterated Boolean games
- Making the best of limited memory in multi-player discounted sum games
- mcmas: A Model Checker for Multi-agent Systems
- Model checking a path (preliminary report)
- Model checking abilities of agents: a closer look
- Model checking discounted temporal properties
- Model Checking Logics of Strategic Ability: Complexity*
- Model-checking for resource-bounded ATL with production and consumption of resources
- Money is memory
- Multiagent Systems
- On epistemic temporal strategic logic
- On promptness in parity games
- On the (un-)decidability of model checking resource-bounded agents
- On the Expressiveness and Complexity of ATL
- PRISM-games: a model checker for stochastic multi-player games
- Process logic: Expressiveness, decidability, completeness
- Programming Multi-Agent Systems in AgentSpeak usingJason
- Reasoning about agent programs using ATL-like logics
- Reasoning about knowledge and strategies: epistemic strategy logic
- Reasoning about memoryless strategies under partial observability and unconditional fairness constraints
- Reasoning about strategies
- Reasoning about strategies: on the model-checking problem
- Reasoning about strategies: on the satisfiability problem
- Reasoning about temporal properties of rational play
- Receipt-free secret-ballot elections (extended abstract)
- Stability under strategy switching
- Strategy logic
- Strategy representation by decision trees in reactive synthesis
- Succinctness of the complement and intersection of regular expressions
- The polynomial-time hierarchy
- The virtues of idleness: a decidable fragment of resource agent logic
- Timed Concurrent Game Structures
- Verifying agents with memory is harder than it seemed
- What makes \textsc{Atl}* decidable? A decidable fragment of strategy logic
Cited in
(6)- Knowledge-based strategies for multi-agent teams playing against nature
- Stability under strategy switching
- Stability and strategic time-dependent behaviour in multiagent systems
- How good is a strategy in a game with Nature?
- Towards partial order reductions for strategic ability
- A formal approach to attack graphs
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)
