Fetching the paper…
Reading the bibliography…
State-of-the-art methods for solving 2-player zero-sum imperfect information games rely on linear programming or regret minimization, though not on dynamic programming (DP) or heuristic search (HS), while the latter are often at the core of state-of-the-art solvers for other sequential decision-making problems.
OpenSpiel: A framework for reinforcement learning in games
Marc Lanctot, Edward Lockhart, Jean-Baptiste Lespiau, Vinicius Zambaldi, Satyaki Upadhyay, Julien Pérolat, Sriram Srinivasan, Finbarr Timbers, Karl Tuyls, Shayegan Omidshafiei, Daniel Hennes, Dustin Morrill, Paul Muller, Timo Ewalds, Ryan Faulkner, János Kramár, Bart De Vylder, Brennan Saeta, James Bradbury, David Ding, Sebastian Borgeaud, Matthew Lai, Julian Schrittwieser, Thomas Anthony, Edward Hughes, Ivo Danihelka, and Jonah Ryan-Davis · 1908
Earlier work this paper cites.
Zur Theorie der Gesellschaftsspiele
John von Neumann · 1928
Earlier work this paper cites.
Simplified two-person Poker
Harold W. Kuhn · 1950
Earlier work this paper cites.
Optimal control of Markov processes with incomplete state information
Karl Åström · 1965
Earlier work this paper cites.
Games with incomplete information played by "Bayesian" players, I-III. part II. Bayesian equilibrium points
John C. Harsanyi · 1968
Earlier work this paper cites.
Fast algorithms for finding randomized strategies in game trees
Daphne Koller, Nimrod Megiddo, and Bernhard von Stengel · 1994
Earlier work this paper cites.
Efficient computation of equilibria for extensive two-person games
Daphne Koller, Nimrod Megiddo, and Bernhard von Stengel · 1996
Earlier work this paper cites.
Efficient computation of behavior strategies
Bernhard von Stengel · 1996
Earlier work this paper cites.
Dynamic games with hidden actions and hidden states
Harold L. Cole and Narayama Kocherlakota · 2001
Earlier work this paper cites.
Zero-sum stochastic games with partial information
Mrinal K. Ghosh, David R. McDonald, and Sagnik Sinha · 2004
Earlier work this paper cites.
Point-based POMDP algorithms: Improved analysis and implementation
Trey Smith and R.G. Simmons · 2005
Earlier work this paper cites.
MAA*: A heuristic search algorithm for solving decentralized POMDPs
Daniel Szer, François Charpillet, and Shlomo Zilberstein · 2005
Earlier work this paper cites.
Dec-POMDPs and extensive form games: equivalence of models and algorithms
Frans Oliehoek and Nikos Vlassis · 2006
Earlier work this paper cites.
Probabilistic Planning for Robotic Exploration
Trey Smith · 2007
Cited alongside, same era.
Regret minimization in games with incomplete information
Martin Zinkevich, Michael Johanson, Michael Bowling, and Carmelo Piccione · 2007
Cited alongside, same era.
Monte carlo sampling for regret minimization in extensive games
Marc Lanctot, Kevin Waugh, Martin Zinkevich, and Michael Bowling · 2009
Cited alongside, same era.
Smoothing techniques for computing nash equilibria of sequential games
Samid Hoda, Andrew Gilpin, Javier Peña, and Tuomas Sandholm · 2010
Cited alongside, same era.
An exact double-oracle algorithm for zero-sum extensive-form games with imperfect information
Branislav Bošanský, Christopher Kiekintveld, Viliam Lisý, and Michal Pěchouček · 2014
Cited alongside, same era.
Heuristic search value iteration for one-sided partially observable stochastic games
Karel Horák, Branislav Bošanský, and Michal Pěchouček · 2017
Later among the works it cites.
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
Later among the works it cites.
Cooperative multi-agent policy gradient
Guillaume Bono, Jilles Dibangoye, Laëtitia Matignon, Florian Pereyron, and Olivier Simonin · 2018
Later among the works it cites.
Superhuman AI for heads-up no-limit poker: Libratus beats top professionals
Noam Brown and Tuomas Sandholm · 2018
Later among the works it cites.
Revisiting cfr+ and alternating updates
Neil Burch, Matej Moravcik, and Martin Schmid · 2019
Later among the works it cites.
Scalable Algorithms for Solving Stochastic Games with Limited Partial Observability
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Neil Burch, Michael Johanson, and Michael Bowling · 2014
Cited alongside, same era.
Partial-observation stochastic games: How to win when belief fails
Krishnendu Chatterjee and Laurent Doyen · 2014
Cited alongside, same era.
Solving large imperfect information games using cfr+
Oskari Tammelin · 2014
Cited alongside, same era.
Finite- and infinite-horizon Shapley games with nonsymmetric partial observation
Arnab Basu and Lukasz Stettner · 2015
Cited alongside, same era.
Structure in the value function of two-player zero-sum games of incomplete information
Auke Wiggers · 2015
Cited alongside, same era.
A security game combining patrolling and alarm–triggered responses under spatial and detection uncertainties
Nicola Basilico, Giuseppe De Nittis, and Nicola Gatti · 2016
Cited alongside, same era.
Optimally solving Dec-POMDPs as continuous-state MDPs
Jilles Dibangoye, Chris Amato, Olivier Buffet, and François Charpillet · 2016
Cited alongside, same era.
Karel Horák · 2019
Later among the works it cites.
Solving partially observable stochastic games with public observations
Karel Horák and Branislav Bošanský · 2019
Later among the works it cites.
Value functions for depth-limited solving in imperfect-information games
Vojtěch Kovařík, Dominik Seitz, Viliam Lisỳ, Jan Rudolf, Shuo Sun, and Karel Ha · 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.
Faster algorithms for extensive-form game solving via improved smoothing functions
Christian Kroer, Kevin Waugh, Fatma Kılınç-Karzan, and Tuomas Sandholm · 2020
Later among the works it cites.
Search in Imperfect Information Games
Martin Schmid · 2021
Later among the works it cites.
Martin Schmid, Matej Moravcik, Neil Burch, Rudolf Kadlec, Joshua Davidson, Kevin Waugh, Nolan Bard, Finbarr Timbers, Marc Lanctot, Zach Holland, Elnaz Davoodi, Alden Christianson, and Michael Bowling · 2021
Later among the works it cites.