Asynchronous Agents with Perfect Recall: Model Reductions, Knowledge-Based Construction, and Model Checking for Coalitional Strategies

๐Ÿ“… 2024-12-09
๐Ÿ›๏ธ arXiv.org
๐Ÿ“ˆ Citations: 0
โœจ Influential: 0
๐Ÿ“„ PDF
๐Ÿค– AI Summary
Verifying cooperative strategy models for memory-equipped agents in asynchronous multi-agent systems (MAS) remains challenging due to the misalignment between conventional model reduction techniques and the asynchronous interactions and knowledge evolution inherent to memoryful agents. Method: We propose a knowledge-driven verification framework featuring: (i) a novel asynchronous strategy execution semantics integrating concurrent game structures (CGS) with interleaved interpreted systems (IIS); (ii) an extension of partial-order reduction to memory-aware settings, with the first formal proof of capability-preserving correctness; and (iii) a knowledge-base subset construction method enabling knowledge-sensitive state-space compression tailored to memoryful agents. Contribution/Results: The framework significantly reduces the computational complexity of cooperative capability verification and establishes both theoretical foundations and practical tools for synthesizing verifiably correct, knowledge-driven strategies in asynchronous MAS.

Technology Category

Application Category

๐Ÿ“ Abstract
Model checking of strategic abilities for agents with memory is a notoriously hard problem, and very few attempts have been made to tackle it. In this paper, we present two important steps towards this goal. First, we take the partial-order reduction scheme that was recently proved to preserve individual and coalitional abilities of memoryless agents, and show that it also works for agents with memory. Secondly, we take the Knowledge-Based Subset Construction, that was recently studied for synchronous concurrent games, and adapt it to preserve abilities of memoryful agents in asynchronous MAS. On the way, we also propose a new execution semantics for strategies in asynchronous MAS, that combines elements of Concurrent Game Structures and Interleaved Interpreted Systems in a natural and intuitive way.
Problem

Research questions and friction points this paper is trying to address.

Extending partial-order reduction to memoryful agents in asynchronous systems
Adapting knowledge-based construction for coalitional strategies with memory
Proposing new execution semantics combining game structures and interleaved systems
Innovation

Methods, ideas, or system contributions that make the work stand out.

Partial-order reduction extended to memoryful agents
Knowledge-Based Subset Construction adapted for asynchronous MAS
New execution semantics combining CGS and IIS elements
D
D. Gurov
KTH Royal Institute of Technology, Stockholm, Sweden
F
Filip Jamroga
Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland
Wojciech Jamroga
Wojciech Jamroga
Polish Academy of Sciences
artificial intelligencemulti-agent systemsgame theoryverification
M
Mateusz Kamiล„ski
Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland; Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Toruล„, Poland
D
Damian Kurpiewski
Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland; Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Toruล„, Poland
Wojciech Penczek
Wojciech Penczek
Professor of Computer Science, ICS PAS (Warsaw)
Model checkingFormal methodsPetri NetsReal-time systemsMulti-agent systems
T
Teofil Sidoruk
Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland