Fetching the paper…
Reading the bibliography…
Historically applied exclusively to perfect information games, depth-limited search with value functions has been key to recent advances in AI for imperfect information games.
Equation of state calculations by fast computing machines
Nicholas Metropolis, Arianna W Rosenbluth, Marshall N Rosenbluth, Augusta H Teller, and Edward Teller · 1953
Earlier work this paper cites.
Monte Carlo sampling methods using Markov chains and their applications
W Keith Hastings · 1970
Earlier work this paper cites.
Theoretical improvements in algorithmic efficiency for network flow problems
Jack Edmonds and Richard M Karp · 1972
Earlier work this paper cites.
Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images
Stuart Geman and Donald Geman · 1984
Earlier work this paper cites.
Random generation of combinatorial structures from a uniform distribution
Mark R Jerrum, Leslie G Valiant, and Vijay V Vazirani · 1986
Earlier work this paper cites.
The million pound bridge program
David NL Levy · 1989
Earlier work this paper cites.
The complexity of decision versus search
Mihir Bellare and Shafi Goldwasser · 1994
Earlier work this paper cites.
Solving the game of Checkers
Jonathan Schaeffer and Robert Lake · 1996
Earlier work this paper cites.
The dynamics of reinforcement learning in cooperative multiagent systems
Caroline Claus and Craig Boutilier · 1998
Earlier work this paper cites.
GIB: Imperfect information in a computationally challenging game
Matthew L Ginsberg · 2001
Earlier work this paper cites.
Deep Blue
Murray Campbell, A Joseph Hoane Jr, and Feng-hsiung Hsu · 2002
Cited alongside, same era.
Finite Markov chains and algorithmic applications
Olle Häggström et al · 2002
Cited alongside, same era.
The Penguin Book of Card Games
David Parlett · 2008
Cited alongside, same era.
Improving state evaluation, inference, and search in trick-based card games
Michael Buro, Jeffrey Richard Long, Timothy Furtak, and Nathan R Sturtevant · 2009
Cited alongside, same era.
Information Set Monte Carlo Tree Search
Peter I Cowling, Edward J Powley, and Daniel Whitehouse · 2012
Cited alongside, same era.
Information set generation in partially observable games
Mark Richards and Eyal Amir · 2012
Cited alongside, same era.
Mastering the game of Go without human knowledge
David Silver, Julian Schrittwieser, Karen Simonyan, Ioannis Antonoglou, Aja Huang, Arthur Guez, Thomas Hubert, Lucas Baker, Matthew Lai, Adrian Bolton, et al · 2017
Later among the works it cites.
Superhuman AI for multiplayer poker
Noam Brown and Tuomas Sandholm · 2019
Later among the works it cites.
Rethinking formal models of partially observable multiagent decision making
Vojtěch Kovařík, Martin Schmid, Neil Burch, Michael Bowling, and Viliam Lisỳ · 2019
Later among the works it cites.
Combining deep reinforcement learning and search for imperfect-information games
Noam Brown, Anton Bakhtin, Adam Lerer, and Qucheng Gong · 2020
Later among the works it cites.
Value functions for depth-limited solving in imperfect-information games
Vojtěch Kovařík, Dominik Seitz, V Lisy, Jan Rudolf, Shuo Sun, and Karel Ha · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Ashutosh Nayyar, Aditya Mahajan, and Demosthenis Teneketzis · 2013
Cited alongside, same era.
Sufficient plan-time statistics for decentralized pomdps
Frans Adriaan Oliehoek · 2013
Cited alongside, same era.
Optimally solving dec-pomdps as continuous-state mdps
Jilles Steeve Dibangoye, Christopher Amato, Olivier Buffet, and François Charpillet · 2016
Cited alongside, same era.
Deepstack: Expert-level artificial intelligence in heads-up no-limit poker
Matej Moravčík, Martin Schmid, Neil Burch, Viliam Lisỳ, Dustin Morrill, Nolan Bard, Trevor Davis, Kevin Waugh, Michael Johanson, and Michael Bowling · 2017
Cited alongside, same era.
Scalable online planning via reinforcement learning fine-tuning
Arnaud Fickinger, Hengyuan Hu, Brandon Amos, Stuart Russell, and Noam Brown · 2021
Later among the works it cites.
Martin Schmid, Matej Moravcik, Neil Burch, Rudolf Kadlec, Josh Davidson, Kevin Waugh, Nolan Bard, Finbarr Timbers, Marc Lanctot, Zach Holland, et al · 2021
Later among the works it cites.
Learning to guess opponent’s information in large partially observable games
Dominik Seitz, Nikita Milyukov, and Viliam Lisỳ · 2021
Later among the works it cites.
A fine-tuning approach to belief state modeling
Samuel Sokota, Hengyuan Hu, David J Wu, J Zico Kolter, Jakob Nicolaus Foerster, and Noam Brown · 2021
Later among the works it cites.
Particle value functions in imperfect information games
Michal Šustr, Vojtech Kovarík, and Viliam Lisy · 2021
Later among the works it cites.