Higher-Order Belief in Incomplete Information MAIDs

Jack Foxabbott, Rohan Subramani, Francis Rhys Ward
3/8/2025
cs.AIcs.MA

No confident code implementation found for this paper.

Abstract

Multi-agent influence diagrams (MAIDs) are probabilistic graphical models which represent strategic interactions between agents. MAIDs are equivalent to extensive form games (EFGs) but have a more compact and informative structure. However, MAIDs cannot, in general, represent settings of incomplete information -- wherein agents have different beliefs about the game being played, and different beliefs about each-other's beliefs. In this paper, we introduce incomplete information MAIDs (II-MAIDs). We define both infinite and finite-depth II-MAIDs and prove an equivalence relation to EFGs with incomplete information and no common prior over types. We prove that II-MAIDs inherit classical equilibria concepts via this equivalence, but note that these solution concepts are often unrealistic in the setting with no common prior because they violate common knowledge of rationality. We define a more realistic solution concept based on recursive best-response. Throughout, we describe an example with a hypothetical AI agent undergoing evaluation to illustrate the applicability of II-MAIDs.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{foxabbott2025higherorder,
  title  = {Higher-Order Belief in Incomplete Information MAIDs},
  author = {Jack Foxabbott and Rohan Subramani and Francis Rhys Ward},
  year   = {2025},
  eprint = {2503.06323},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2503.06323v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2503.06323.svg)](https://codeofpaper.com/paper/2503.06323)

Discussion