Skip to main content
archive
Search Submit Donate Log in
Press Enter to search · Advanced search

Computer Science > Machine Learning

arXiv:1902.00506 (cs)
[Submitted on 1 Feb 2019 (v1), last revised 6 Dec 2019 (this version, v2)]

Title:The Hanabi Challenge: A New Frontier for AI Research

Authors:Nolan Bard, Jakob N. Foerster, Sarath Chandar, Neil Burch, Marc Lanctot, H. Francis Song, Emilio Parisotto, Vincent Dumoulin, Subhodeep Moitra, Edward Hughes, Iain Dunning, Shibl Mourad, Hugo Larochelle, Marc G. Bellemare, Michael Bowling
View a PDF of the paper titled The Hanabi Challenge: A New Frontier for AI Research, by Nolan Bard and 14 other authors
View PDF HTML (experimental)
Abstract:From the early days of computing, games have been important testbeds for studying how well machines can do sophisticated decision making. In recent years, machine learning has made dramatic advances with artificial agents reaching superhuman performance in challenge domains like Go, Atari, and some variants of poker. As with their predecessors of chess, checkers, and backgammon, these game domains have driven research by providing sophisticated yet well-defined challenges for artificial intelligence practitioners. We continue this tradition by proposing the game of Hanabi as a new challenge domain with novel problems that arise from its combination of purely cooperative gameplay with two to five players and imperfect information. In particular, we argue that Hanabi elevates reasoning about the beliefs and intentions of other agents to the foreground. We believe developing novel techniques for such theory of mind reasoning will not only be crucial for success in Hanabi, but also in broader collaborative efforts, especially those with human partners. To facilitate future research, we introduce the open-source Hanabi Learning Environment, propose an experimental framework for the research community to evaluate algorithmic advances, and assess the performance of current state-of-the-art techniques.
Comments: 32 pages, 5 figures, In Press (Artificial Intelligence)
Subjects: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Machine Learning (stat.ML)
Cite as: arXiv:1902.00506 [cs.LG]
  (or arXiv:1902.00506v2 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.1902.00506
arXiv-issued DOI via DataCite
Related DOI: https://doi.org/10.1016/j.artint.2019.103216
DOI(s) linking to related resources

Submission history

From: Nolan Bard [view email]
[v1] Fri, 1 Feb 2019 18:59:07 UTC (511 KB)
[v2] Fri, 6 Dec 2019 22:15:35 UTC (556 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled The Hanabi Challenge: A New Frontier for AI Research, by Nolan Bard and 14 other authors
  • View PDF
  • HTML (experimental)
  • TeX Source
view license

Current browse context:

cs.LG
< prev   |   next >
new | recent | 2019-02
Change to browse by:
cs
cs.AI
stat
stat.ML

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar

1 blog link

(what is this?)

DBLP - CS Bibliography

listing | bibtex
Nolan Bard
Jakob N. Foerster
Sarath Chandar
Neil Burch
Marc Lanctot
…
Loading...

BibTeX formatted citation

Data provided by:

Bookmark

BibSonomy Reddit

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
We gratefully acknowledge support from our major funders, member institutions, , and all contributors.
About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)
Major funding support from
Simons Foundation Simons Foundation International Schmidt Sciences