Fetching the paper…
Reading the bibliography…
Extensive-Form Game (EFG) represents a fundamental model for analyzing sequential interactions among multiple agents and the primary challenge to solve it lies in mitigating sample complexity.
Computing equilibria of two-person games from the extensive form
Robert Wilson · 1972
Earlier work this paper cites.
Games in extensive and strategic forms
Sergiu Hart · 1992
Earlier work this paper cites.
Finding mixed strategies with small supports in extensive form games
Daphne Koller and Nimrod Megiddo · 1996
Earlier work this paper cites.
Planning in the presence of cost functions controlled by an adversary
H Brendan McMahan, Geoffrey J Gordon, and Avrim Blum · 2003
Earlier work this paper cites.
Solving the oshi-zumo game
Michael Buro · 2004
Earlier work this paper cites.
Combining deep reinforcement learning and search for imperfect-information games
Noam Brown, Anton Bakhtin, Adam Lerer, and Qucheng Gong · 2007
Earlier work this paper cites.
Regret minimization in games with incomplete information
Martin Zinkevich, Michael Johanson, Michael Bowling, and Carmelo Piccione · 2007
Earlier work this paper cites.
Monte carlo sampling for regret minimization in extensive games
Marc Lanctot, Kevin Waugh, Martin Zinkevich, and Michael Bowling · 2009
Earlier work this paper cites.
Efficient monte carlo counterfactual regret minimization in games with many player actions
Neil Burch, Marc Lanctot, Duane Szafron, and Richard Gibson · 2012
Earlier work this paper cites.
An exact double-oracle algorithm for zero-sum extensive-form games with imperfect information
Branislav Bosansky, Christopher Kiekintveld, Viliam Lisy, and Michal Pechoucek · 2014
Earlier work this paper cites.
Fictitious self-play in extensive-form games
Johannes Heinrich, Marc Lanctot, and David Silver · 2015
Cited alongside, same era.
Algorithms for computing strategies in two-player simultaneous move games
Branislav Bošanskỳ, Viliam Lisỳ, Marc Lanctot, Jiří Čermák, and Mark HM Winands · 2016
Cited alongside, same era.
Strategy-based warm starting for regret minimization in games
Noam Brown and Tuomas Sandholm · 2016
Cited alongside, same era.
The theory of extensive form games
Klaus Ritzberger et al · 2016
Cited alongside, same era.
Superhuman ai for heads-up no-limit poker: Libratus beats top professionals
Noam Brown and Tuomas Sandholm · 2017
Cited alongside, same era.
A unified game-theoretic approach to multiagent reinforcement learning
Marc Lanctot, Vinicius Zambaldi, Audrunas Gruslys, Angeliki Lazaridou, Karl Tuyls, Julien Pérolat, David Silver, and Thore Graepel · 2017
Stochastic regret minimization in extensive-form games
Gabriele Farina, Christian Kroer, and Tuomas Sandholm · 2020
Later among the works it cites.
Dream: Deep regret minimization with advantage baselines and model-free learning
Eric Steinberger, Adam Lerer, and Noam Brown · 2020
Later among the works it cites.
XDO: A double oracle algorithm for extensive-form games
Stephen McAleer, John Lanier, Pierre Baldi, and Roy Fox · 2021
Later among the works it cites.
Iterative empirical game solving via single policy best response
Max Olan Smith, Thomas Anthony, and Michael P Wellman · 2021
Later among the works it cites.
Near-optimal learning of extensive-form games with imperfect information
Yu Bai, Chi Jin, Song Mei, and Tiancheng Yu · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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.
Deep counterfactual regret minimization
Noam Brown, Adam Lerer, Sam Gross, and Tuomas Sandholm · 2019
Cited alongside, same era.
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, et al · 2019
Cited alongside, same era.
Solving imperfect-information games via discounted regret minimization
Noam Brown and Tuomas Sandholm
Cited in the paper.
Superhuman ai for multiplayer poker
Noam Brown and Tuomas Sandholm
Cited in the paper.
Combining deep reinforcement learning and search for imperfect-information games
Noam Brown, Anton Bakhtin, Adam Lerer, and Qucheng Gong
Cited in the paper.
Online double oracle
Le Cong Dinh, Stephen Marcus McAleer, Zheng Tian, Nicolas Perez-Nieves, Oliver Slumbers, David Henry Mguni, Jun Wang, Haitham Bou Ammar, and Yaodong Yang · 2022
Later among the works it cites.
Anytime optimal psro for two-player zero-sum games
Stephen McAleer, Kevin Wang, Marc Lanctot, John Lanier, Pierre Baldi, and Roy Fox · 2022
Later among the works it cites.
Efficient policy space response oracles
Ming Zhou, Jingxiao Chen, Ying Wen, Weinan Zhang, Yaodong Yang, Yong Yu, and Jun Wang · 2022
Later among the works it cites.
Regret-minimizing double oracle for extensive-form games
Xiaohang Tang, Le Cong Dihn, Stephen Marcus Mcaleer, Yaodong Yang, et al · 2023
Later among the works it cites.