AILOJul 13, 2017

Strategic Coalitions with Perfect Recall

arXiv:1707.04298v231 citations
Originality Synthesis-oriented
AI Analysis

This work addresses a theoretical problem in formal logic for researchers in multi-agent systems, but it is incremental as it builds on existing systems by adding a perfect recall assumption.

The paper tackles the problem of modeling strategic coalitions with perfect recall by proposing a bimodal logic that integrates distributed knowledge and coalition know-how modalities, and it establishes soundness and completeness theorems as the main results.

The paper proposes a bimodal logic that describes an interplay between distributed knowledge modality and coalition know-how modality. Unlike other similar systems, the one proposed here assumes perfect recall by all agents. Perfect recall is captured in the system by a single axiom. The main technical results are the soundness and the completeness theorems for the proposed logical system.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes