Approximate verification of strategic abilities under imperfect information

DOI10.1016/J.ARTINT.2019.103172zbMATH Open1478.68384DBLPjournals/ai/JamrogaKKM19OpenAlexW2972923404WikidataQ104379617 ScholiaQ104379617MaRDI QIDQ2289016FDOQ2289016

Authors Wojciech Jamroga, Michał Knapik, Damian Kurpiewski, Łukasz Mikulski

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/41791

zbMATH Keywords

model checkingimperfect informationalternating-time temporal logicstrategic abilityalternating \(\mu\)-calculusapproximate verification

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Agent technology and artificial intelligence (68T42) Temporal logic (03B44) Rationality and learning in game theory (91A26)

Recommendations

• Theoretical Computer Science
• SMC: synthesis of uniform strategies and verification of strategic ability for multi-agent systems
• Towards partial order reductions for strategic ability
• Model checking abilities of agents: a closer look
• scientific article; zbMATH DE number 7297884

Cites work

• scientific article; zbMATH DE number 5954369 (Why is no real title available?)
• scientific article; zbMATH DE number 2182496 (Why is no real title available?)
• scientific article; zbMATH DE number 1903350 (Why is no real title available?)
• scientific article; zbMATH DE number 2102712 (Why is no real title available?)
• scientific article; zbMATH DE number 7311252 (Why is no real title available?)
• scientific article; zbMATH DE number 3359806 (Why is no real title available?)
• Algorithms for Omega-Regular Games with Imperfect Information
• Alternating-time logic with imperfect recall
• Alternating-time temporal logic
• An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking
• An improved equivalence algorithm
• Binary decision diagrams
• Computer Aided Verification
• Epistemic ATL with perfect recall, past and strategy contexts
• Hierarchical information patterns and distributed strategy synthesis
• Information tracking in games on graphs
• Model Checking Logics of Strategic Ability: Complexity*
• Optimizing epistemic model checking using conditional independence (extended abstract)
• Reasoning about memoryless strategies under partial observability and unconditional fairness constraints
• Relating paths in transition systems: the fall of the modal mu-calculus
• SMC: synthesis of uniform strategies and verification of strategic ability for multi-agent systems
• Symbolic model checking: \(10^{20}\) states and beyond
• Synthesis and verification of uniform strategies for multi-agent systems
• mcmas: A Model Checker for Multi-agent Systems

Cited in

(7)

• scientific article; zbMATH DE number 7297884 (Why is no real title available?)
• scientific article; zbMATH DE number 7533366 (Why is no real title available?)
• Approximating Perfect Recall when Model Checking Strategic Abilities: Theory and Applications
• Towards partial order reductions for strategic ability
• Theoretical Computer Science
• Multi-valued verification of strategic ability
• An abstraction-refinement framework for verifying strategic properties in multi-agent systems with imperfect information

Describes a project that uses

Uses Software

• MCMAS
• MCK
• MOCHA
• jMocha

This page was built for publication: Approximate verification of strategic abilities under imperfect information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289016)