mlsanityData to 7 Oct 2026

Theory of Mind for Deep Reinforcement Learning in Hanabi

arXiv 2101.09328 ↗First posted 22 Jan 2021cs.AIcited by 11

Not on the map. Why?

Abstract (arXiv)

The partially observable card game Hanabi has recently been proposed as a new AI challenge problem due to its dependence on implicit communication conventions and apparent necessity of theory of mind reasoning for efficient play. In this work, we propose a mechanism for imbuing Reinforcement Learning agents with a theory of mind to discover efficient cooperative strategies in Hanabi. The primary contributions of this work are threefold: First, a formal definition of a computationally tractable mechanism for computing hand probabilities in Hanabi. Second, an extension to conventional Deep Reinforcement Learning that introduces reasoning over finitely nested theory of mind belief hierarchies. Finally, an intrinsic reward mechanism enabled by theory of mind that incentivizes agents to share strategically relevant private knowledge with their teammates. We demonstrate the utility of our algorithm against Rainbow, a state-of-the-art Reinforcement Learning agent.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 5 of its 16 references that are in the map. First posted on arXiv 22 Jan 2021.

Builds on

5 of 16 references.

References · 5

  1. 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,218
  2. 2017Rainbow: Combining Improvements in Deep Reinforcement Learningcited by 774
  3. 2019The Hanabi Challenge: A New Frontier for AI Researchcited by 194
  4. 2018Bayesian Action Decoder for Deep Multi-Agent Reinforcement Learningcited by 67
  5. 2017QMDP-Net: Deep Learning for Planning under Partial Observabilitycited by 51

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 3; 2023: 2; 2024: 1; 2025: 2; 2026: 2.

11 papers.