Fetching the paper…
Reading the bibliography…
Hanabi is a cooperative game that brings the problem of modeling other players to the forefront.
J. Foerster, F. Song, E. Hughes, N. Burch, I. Dunning, S. Whiteson, M. Botvinick, and M. Bowling, “Bayesian action decoder for deep multi-agent reinforcement learning,” in International Conference on Machine Learning . PMLR, 2019, pp. 1942–1951
1951
Earlier work this paper cites.
H. P. Grice, “Logic and conversation,” in Speech acts . Brill, 1975, pp. 41–58
1975
Earlier work this paper cites.
I. Rish et al. , “An empirical study of the naive bayes classifier,” in IJCAI 2001 workshop on empirical methods in artificial intelligence , vol. 3, no. 22, 2001, pp. 41–46
2001
Earlier work this paper cites.
M. Campbell, A. J. Hoane Jr, and F.-h. Hsu, “Deep blue,” Artificial intelligence , vol. 134, no. 1-2, pp. 57–83, 2002
2002
Earlier work this paper cites.
G. Tesauro, “Extending Q-learning to general adaptive multi-agent systems,” in Advances in neural information processing systems . Citeseer, 2003, p. None
2003
Earlier work this paper cites.
G. Chalkiadakis and C. Boutilier, “Coordination in multiagent reinforcement learning: A bayesian approach,” in Proceedings of the second international joint conference on Autonomous agents and multiagent systems , 2003, pp. 709–716
2003
Earlier work this paper cites.
2004
Earlier work this paper cites.
P. Stone, G. A. Kaminka, S. Kraus, and J. S. Rosenschein, “Ad hoc autonomous agent teams: Collaboration without pre-coordination,” in Twenty-Fourth AAAI Conference on Artificial Intelligence , 2010
2010
Earlier work this paper cites.
J. Lehman and K. O. Stanley, “Abandoning objectives: Evolution through the search for novelty alone,” Evolutionary computation , vol. 19, no. 2, pp. 189–223, 2011
2011
Earlier work this paper cites.
T. N. Hoang and K. H. Low, “A general framework for interacting bayes-optimally with self-interested agents using arbitrary parametric model and model prior,” in Twenty-Third International Joint Conference on Artificial Intelligence , 2013
2013
Earlier work this paper cites.
K. Deb, “Multi-objective optimization,” in Search methodologies . Springer, 2014, pp. 403–449
2014
Earlier work this paper cites.
C. Cox, J. De Silva, P. Deorsey, F. H. Kenter, T. Retter, and J. Tobin, “How to make the perfect fireworks display: Two strategies for Hanabi,” Mathematics Magazine , vol. 88, no. 5, pp. 323–336, 2015
2015
Earlier work this paper cites.
H. Osawa, “Solving Hanabi: Estimating hands by opponent’s actions in cooperative game with incomplete information.” in AAAI workshop: Computer Poker and Imperfect Information , 2015, pp. 37–43
2015
Earlier work this paper cites.
2015
Cited alongside, same era.
A. Cully, J. Clune, D. Tarapore, and J.-B. Mouret, “Robots that can adapt like animals,” Nature , vol. 521, no. 7553, p. 503, 2015
2015
Cited alongside, same era.
D. Silver, A. Huang, C. J. Maddison, A. Guez, L. Sifre, G. Van Den Driessche, J. Schrittwieser, I. Antonoglou, V. Panneershelvam, M. Lanctot et al. , “Mastering the game of Go with deep neural networks and tree search,” nature , vol. 529, no. 7587, pp. 484–489, 2016
2016
Cited alongside, same era.
M. J. van den Bergh, A. Hommelberg, W. A. Kosters, and F. M. Spieksma, “Aspects of the cooperative card game Hanabi,” in Benelux Conference on Artificial Intelligence . Springer, 2016, pp. 93–105
2016
Cited alongside, same era.
J. Walton-Rivers, P. R. Williams, and R. Bartle, “The 2018 Hanabi competition,” in 2019 IEEE Conference on Games (CoG) . IEEE, 2019, pp. 1–8
2019
Later among the works it cites.
C. Liang, J. Proft, E. Andersen, and R. A. Knepper, “Implicit communication of actionable information in human-AI teams,” in Proceedings of the 2019 CHI Conference on Human Factors in Computing Systems , 2019, pp. 1–13
2019
Later among the works it cites.
J. Goodman, “Re-determinizing MCTS in Hanabi,” in 2019 IEEE Conference on Games (CoG) . IEEE, 2019, pp. 1–8
2019
Later among the works it cites.
M. C. Fontaine, S. Lee, L. B. Soros, F. de Mesentier Silva, J. Togelius, and A. K. Hoover, “Mapping Hearthstone deck spaces through map-elites with sliding boundaries,” in Proceedings of The Genetic and Evolutionary Computation Conference , 2019, pp. 161–169
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. K. Pugh, L. B. Soros, and K. O. Stanley, “Quality diversity: A new frontier for evolutionary computation,” Frontiers in Robotics and AI , vol. 3, p. 40, 2016
2016
Cited alongside, same era.
N. Hansen, “The CMA evolution strategy: A tutorial,” arXiv preprint arXiv:1604.00772 , 2016
2016
Cited alongside, same era.
J. Walton-Rivers, P. R. Williams, R. Bartle, D. Perez-Liebana, and S. M. Lucas, “Evaluating and modelling Hanabi-playing agents,” in Evolutionary Computation (CEC), 2017 IEEE Congress on . IEEE, 2017, pp. 1382–1389
2017
Cited alongside, same era.
B. Bouzy, “Playing Hanabi near-optimally,” in Advances in Computer Games . Springer, 2017, pp. 51–62
2017
Cited alongside, same era.
M. Eger, C. Martens, and M. Alfaro Córdoba, “An intentional AI for Hanabi,” in Computational Intelligence and Games (CIG), 2017 IEEE Conference on . IEEE, 2017, pp. 68–75
2017
Cited alongside, same era.
R. Canaan, H. Shen, R. Torrado, J. Togelius, A. Nealen, and S. Menzel, “Evolving agents for the Hanabi 2018 CIG competition,” in 2018 IEEE Conference on Computational Intelligence and Games (CIG) . IEEE, 2018, pp. 1–8
2018
Cited alongside, same era.
O. Vinyals, I. Babuschkin, W. M. Czarnecki, M. Mathieu, A. Dudzik, J. Chung, D. H. Choi, R. Powell, T. Ewalds, P. Georgiev et al. , “Grandmaster level in StarCraft II using multi-agent reinforcement learning,” Nature , vol. 575, no. 7782, pp. 350–354, 2019
2019
Cited alongside, same era.
R. Canaan, J. Togelius, A. Nealen, and S. Menzel, “Diverse agents for ad-hoc cooperation in Hanabi,” in 2019 IEEE Conference on Games (CoG) . IEEE, 2019, pp. 1–8
2019
Cited alongside, same era.
N. Bard, J. N. Foerster, S. Chandar, N. Burch, M. Lanctot, H. F. Song, E. Parisotto, V. Dumoulin, S. Moitra, E. Hughes et al. , “The Hanabi challenge: A new frontier for AI research,” Artificial Intelligence , vol. 280, p. 103216, 2020
2020
Closest in time.
R. Canaan, X. Gao, Y. Chung, J. Togelius, A. Nealen, and S. Menzel, “Behavioral evaluation of Hanabi Rainbow DQN agents and rule-based agents,” in Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment , vol. 16, no. 1, 2020, pp. 31–37
2020
Closest in time.
A. Lerer, H. Hu, J. Foerster, and N. Brown, “Improving policies via search in cooperative partially observable games,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 34, no. 05, 2020, pp. 7187–7194
2020
Closest in time.
H. Hu, A. Lerer, A. Peysakhovich, and J. Foerster, ““other-play” for zero-shot coordination,” in International Conference on Machine Learning . PMLR, 2020, pp. 4399–4410
2020
Closest in time.
M. C. Fontaine, J. Togelius, S. Nikolaidis, and A. K. Hoover, “Covariance matrix adaptation for the rapid illumination of behavior space,” in Proceedings of the 2020 genetic and evolutionary computation conference , 2020, pp. 94–102
2020
Closest in time.
BoardGameGeek, “Spiel des jahres,” access: 02/21/2021. [Online]. Available: https://boardgamegeek.com/wiki/page/Spiel_des_Jahres
2021
Closest in time.
R&R Games, “Hanabi rules,” access: 07/16/2021. [Online]. Available: https://rnrgames.com/Content/RRGames/images/ProductRules/hanabiRules.PDF
2021
Closest in time.
L. Zintgraf, S. Devlin, K. Ciosek, S. Whiteson, and K. Hofmann, “Deep interactive bayesian reinforcement learning via meta-learning,” in Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems , 2021, pp. 1712–1714
2021
Closest in time.
R. E. Wang, S. A. Wu, J. A. Evans, J. B. Tenenbaum, D. C. Parkes, and M. Kleiman-Weiner, “Too many cooks: Coordinating multi-agent collaboration through inverse planning,” in Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems , 2020, pp. 2032–2034
2034
Closest in time.