Fetching the paper…
Reading the bibliography…
Computational game theory has many applications in the modern world in both adversarial situations and the optimization of social good.
Non-cooperative games
Nash, J. 1951 · 1951
Earlier work this paper cites.
Computability of global solutions to factorable nonconvex programs: Part I–Convex underestimating problems
McCormick, G. P. 1976 · 1976
Earlier work this paper cites.
Efficient computation of behavior strategies
von Stengel, B. 1996 · 1996
Earlier work this paper cites.
Team-maxmin equilibria
von Stengel, B.; and Koller, D. 1997 · 1997
Earlier work this paper cites.
Analysis of bounds for multilinear functions
Ryoo, H. S.; and Sahinidis, N. V. 2001 · 2001
Earlier work this paper cites.
Planning in the presence of cost functions controlled by an adversary
McMahan, H. B.; Gordon, G. J.; and Blum, A. 2003 · 2003
Earlier work this paper cites.
Approximate exploitability: Learning a best response in large games
Timbers, F.; Lockhart, E.; Schmid, M.; Lanctot, M.; and Bowling, M. 2020 · 2004
Earlier work this paper cites.
3-Nash is PPAD-complete
Chen, X.; and Deng, X. 2005 · 2005
Earlier work this paper cites.
Computing the optimal strategy to commit to
Conitzer, V.; and Sandholm, T. 2006 · 2006
Earlier work this paper cites.
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
Shoham, Y.; and Leyton-Brown, K. 2008 · 2008
Cited alongside, same era.
Existence of Nash equilibria in finite extensive form games with imperfect recall: A counterexample
Wichardt, P. C. 2008 · 2008
Cited alongside, same era.
Regret minimization in games with incomplete information
Zinkevich, M.; Johanson, M.; Bowling, M.; and Piccione, C. 2008 · 2008
Cited alongside, same era.
Farina, G.; Celli, A.; Gatti, N.; and Sandholm, T. 2020 · 2009
Cited alongside, same era.
Using counterfactual regret minimization to create competitive multiplayer poker agents
Abou Risk, N.; Szafron, D.; et al. 2010 · 2010
Cited alongside, same era.
Artificial Intelligence: A Modern Approach
Russell, S. J.; and Norvig, P. 2016 · 2016
Later among the works it cites.
DeepStack: Expert-level artificial intelligence in no-limit poker
Moravčík, M.; Schmid, M.; Burch, N.; Lisý, V.; Morrill, D.; Bard, N.; Davis, T.; Waugh, K.; Johanson, M.; and Bowling, M. 2017 · 2017
Later among the works it cites.
Superhuman AI for heads-up no-limit poker: Libratus beats top professionals
Brown, N.; and Sandholm, T. 2018 · 2018
Later among the works it cites.
Computational results for extensive-form adversarial team games
Celli, A.; and Gatti, N. 2018 · 2018
Later among the works it cites.
Ex ante coordination and collusion in zero-sum multi-player extensive-form games
Farina, G.; Celli, A.; Gatti, N.; and Sandholm, T. 2018 · 2018
Later among the works it cites.
Stackelberg Security Games: Looking Beyond a Decade of Success
Sinha, A.; Fang, F.; An, B.; Kiekintveld, C.; and Tambe, M. 2018 · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On minmax theorems for multiplayer games
Cai, Y.; and Daskalakis, C. 2011 · 2011
Cited alongside, same era.
An exact double-oracle algorithm for zero-sum extensive-form games with imperfect information
Bosansky, B.; Kiekintveld, C.; Lisy, V.; and Pechoucek, M. 2014 · 2014
Cited alongside, same era.
Preventing illegal logging: Simultaneous optimization of resource teams and tactics for security
McCarthy, S. M.; Tambe, M.; Kiekintveld, C.; Gore, M. L.; and Killion, A. 2016 · 2016
Cited alongside, same era.
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
Morrison, D. R.; Jacobson, S. H.; Sauppe, J. J.; and Sewell, E. C. 2016 · 2016
Cited alongside, same era.
Computing team-maxmin equilibria in zero-sum multiplayer extensive-form games
Zhang, Y.; and An, B. 2020a
Cited in the paper.
Converging to Team-Maxmin Equilibria in Zero-Sum Multiplayer Games
Zhang, Y.; and An, B. 2020b
Cited in the paper.
Later among the works it cites.
Superhuman AI for multiplayer poker
Brown, N.; and Sandholm, T. 2019 · 2019
Later among the works it cites.
Learning to correlate in multi-player general-sum sequential games
Celli, A.; Marchesi, A.; Bianchi, T.; and Gatti, N. 2019 · 2019
Later among the works it cites.