Fetching the paper…
Reading the bibliography…
We present a framework for computing approximate mixed-strategy Nash equilibria of continuous-action games.
Traité du calcul des probabilités et ses applications , volume IV of Applications aux jeux des hazard
Émile Borel · 1938
Earlier work this paper cites.
A continuous Colonel Blotto game
Oliver Alfred Gross and R. A. Wagner · 1950
Earlier work this paper cites.
Equilibrium points in n-person games
John Nash · 1950
Earlier work this paper cites.
Iterative solutions of games by fictitious play
George W. Brown · 1951
Earlier work this paper cites.
A social equilibrium existence theorem
Gerard Debreu · 1952
Earlier work this paper cites.
Fixed point and minimax theorems in locally convex topological linear spaces
Ky Fan · 1952
Earlier work this paper cites.
A further generalization of the Kakutani fixed point theorem, with application to Nash equilibrium points
I. L. Glicksberg · 1952
Earlier work this paper cites.
The theory of play and integral equations with skew symmetric kernels
Émile Borel · 1953
Earlier work this paper cites.
Notes on games over the square
Irving Leonard Glicksberg and Oliver Alfred Gross · 1953
Earlier work this paper cites.
Contributions to the theory of games , volume 2
Harold William Kuhn and Albert William Tucker · 1953
Earlier work this paper cites.
A rational game on the square
Oliver Alfred Gross · 1957
Earlier work this paper cites.
Existence and uniqueness of equilibrium points for concave n-person games
J. Ben Rosen · 1965
Earlier work this paper cites.
On games over the unit square
Thiruvenkatachari Parthasarathy · 1970
Earlier work this paper cites.
Subjectivity and correlation in randomized strategies
Robert Aumann · 1974
Earlier work this paper cites.
Equilibria of continuous two-person games
Thiruvenkatachari Parthasarathy and Thirukkannamangai Raghavan · 1975
Earlier work this paper cites.
Optimal strategy sets for continuous two person games
H. Chin, Thiruvenkatachari Parthasarathy, and Thirukkannamangai Raghavan · 1976
Earlier work this paper cites.
Distributional strategies for games with incomplete infromation
Paul Milgrom and Robert Weber · 1985
Earlier work this paper cites.
Games played over the unit square
J. Szép, F. Forgó, J. Szép, and F. Forgó · 1985
Earlier work this paper cites.
The existence of equilibrium in discontinuous economic games 1: Theory
P. Dasgupta and Eric Maskin · 1986
Earlier work this paper cites.
Learning representations by back-propagating errors
David E. Rumelhart, Geoffrey E. Hinton, and Ronald J. Williams · 1986
Earlier work this paper cites.
Generalization of backpropagation with application to a recurrent gas market model
Paul J. Werbos · 1988
Earlier work this paper cites.
Noncooperative convex games: computing equilibrium by partial regularization
S. D. Flam and Andrzej Ruszczynski · 1994
Earlier work this paper cites.
The all-pay auction with complete information
Michael R. Baye, Dan Kovenock, and Casper G. de Vries · 1996
Earlier work this paper cites.
Long short-term memory
Sepp Hochreiter and Jürgen Schmidhuber · 1997
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.
Convergence of approximate and incremental subgradient methods for convex optimization
Krzysztof C. Kiwiel · 2004
Earlier work this paper cites.
The Mathematics of Poker
Bill Chen and Jerrod Ankenman · 2006
Earlier work this paper cites.
Generalised weakened fictitious play
David S. Leslie and Edmund J. Collins · 2006
Earlier work this paper cites.
Polynomial games and sum of squares optimization
Pablo A. Parrilo · 2006
Earlier work this paper cites.
Brown’s original fictitious play
Ulrich Berger · 2007
Earlier work this paper cites.
Matplotlib: A 2d graphics environment
J. D. Hunter · 2007
Earlier work this paper cites.
Separable and low-rank continuous games
Noah D. Stein, Asuman Ozdaglar, and Pablo A. Parrilo · 2008
Earlier work this paper cites.
Natural evolution strategies
Daan Wierstra, Tom Schaul, Tobias Glasmachers, Yi Sun, Jan Peters, and Jürgen Schmidhuber · 2008
Cited alongside, same era.
A Blotto game with incomplete information
Tim Adamo and Alexander Matros · 2009
Cited alongside, same era.
Computing equilibria by incorporating qualitative models
Sam Ganzfried and Tuomas Sandholm · 2010
Cited alongside, same era.
On minmax theorems for multiplayer games
Yang Cai and Constantinos Daskalakis · 2011
Cited alongside, same era.
A Blotto game with multi-dimensional incomplete information
Dan Kovenock and Brian Roberson · 2011
Cited alongside, same era.
Very-large-scale generalized combinatorial multi-attribute auctions: Lessons from conducting $60 billion of sourcing
Tuomas Sandholm · 2013
Cited alongside, same era.
Best-shot network games with continuous action space
Papiya Ghosh and Rajendra P. Kundu · 2019
Later among the works it cites.
DeepFP for finding Nash equilibrium in continuous action spaces
Nitin Kamra, Umang Gupta, Kai Wang, Fei Fang, Yan Liu, and Milind Tambe · 2019
Later among the works it cites.
Computing approximate equilibria in sequential adversarial games by exploitability descent
Edward Lockhart, Marc Lanctot, Julien Pérolat, Jean-Baptiste Lespiau, Dustin Morrill, Finbarr Timbers, and Karl Tuyls · 2019
Later among the works it cites.
α \alpha -rank: Multi-agent evaluation by evolution
Shayegan Omidshafiei, Christos Papadimitriou, Georgios Piliouras, Karl Tuyls, Mark Rowland, Jean-Baptiste Lespiau, Wojciech M. Czarnecki, Marc Lanctot, Julien Perolat, and Remi Munos · 2019
Later among the works it cites.
Grandmaster level in StarCraft II using multi-agent reinforcement learning
Oriol Vinyals, Igor Babuschkin, Wojciech M Czarnecki, Michaël Mathieu, Andrew Dudzik, Junyoung Chung, David H Choi, Richard Powell, Timo Ewalds, Petko Georgiev, et al · 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…
OR forum - Blotto politics
Alan Washburn · 2013
Cited alongside, same era.
Regret transfer and parameter optimization
Noam Brown and Tuomas Sandholm · 2014
Cited alongside, same era.
On the properties of neural machine translation: encoder-decoder approaches
Kyunghyun Cho, Bart Van Merriënboer, Dzmitry Bahdanau, and Yoshua Bengio · 2014
Cited alongside, same era.
Generative adversarial nets
Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio · 2014
Cited alongside, same era.
Extensive-form game abstraction with bounds
Christian Kroer and Tuomas Sandholm · 2014
Cited alongside, same era.
Deferred-acceptance auctions and radio spectrum reallocation
Paul Milgrom and Ilya Segal · 2014
Cited alongside, same era.
The DeepMind JAX Ecosystem, 2020
DeepMind, Igor Babuschkin, Kate Baumli, Alison Bell, Surya Bhupatiraju, Jake Bruce, Peter Buchlovsky, David Budden, Trevor Cai, Aidan Clark, Ivo Danihelka, Antoine Dedieu, Claudio Fantacci, Jonathan Godwin, Chris Jones, Ross Hemsley, Tom Hennigan, Matteo Hessel, Shaobo Hou, Steven Kapturowski, Thomas Keck, Iurii Kemaev, Michael King, Markus Kunesch, Lena Martens, Hamza Merzic, Vladimir Mikulik, Tamara Norman, George Papamakarios, John Quan, Roman Ring, Francisco Ruiz, Alvaro Sanchez, Laurent Sartran, Rosalia Schneider, Eren Sezener, Stephen Spencer, Srivatsan Srinivasan, Miloš Stanojević, Wojciech Stokowiec, Luyu Wang, Guangyao Zhou, and Fabio Viola · 2020
Later among the works it cites.
Generative adversarial networks
Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio · 2020
Later among the works it cites.
Learning probably approximately correct maximin strategies in simulation-based games with infinite strategy spaces
Alberto Marchesi, Francesco Trovò, and Nicola Gatti · 2020
Later among the works it cites.
Pipeline PSRO: A scalable approach for finding approximate Nash equilibria in large games
Stephen McAleer, John B. Lanier, Roy Fox, and Pierre Baldi · 2020
Later among the works it cites.
Clock auctions and radio spectrum reallocation
Paul Milgrom and Ilya Segal · 2020
Later among the works it cites.
A generalized training approach for multiagent learning
Paul Muller, Shayegan Omidshafiei, Mark Rowland, Karl Tuyls, Julien Perolat, Siqi Liu, Daniel Hennes, Luke Marris, Marc Lanctot, Edward Hughes, et al · 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.
Double oracle algorithm for computing equilibria in continuous games
Lukáš Adam, Rostislav Horčík, Tomáš Kasl, and Tomáš Kroupa · 2021
Later among the works it cites.
Learning equilibria in symmetric auction games using artificial neural networks
Martin Bichler, Maximilian Fichtl, Stefan Heidekrüger, Nils Kohring, and Paul Sutterer · 2021
Later among the works it cites.
The multiplayer Colonel Blotto game
Enric Boix-Adserà, Benjamin L. Edelman, and Siddhartha Jayanti · 2021
Later among the works it cites.
Algorithm for computing approximate Nash equilibrium in continuous games with application to continuous Blotto
Sam Ganzfried · 2021
Later among the works it cites.
Generative minimization networks: Training GANs without competition
Paulina Grnarova, Yannic Kilcher, Kfir Y. Levy, Aurelien Lucchi, and Thomas Hofmann · 2021
Later among the works it cites.
Generalizations of the General Lotto and Colonel Blotto games
Dan Kovenock and Brian Roberson · 2021
Later among the works it cites.
Evolution strategies for approximate solution of Bayesian games
Zun Li and Michael P. Wellman · 2021
Later among the works it cites.
Multi-agent training beyond zero-sum with correlated equilibrium meta-solvers
Luke Marris, Paul Muller, Marc Lanctot, Karl Tuyls, and Thore Graepel · 2021
Later among the works it cites.
XDO: A double oracle algorithm for extensive-form games
Stephen McAleer, John B. Lanier, Kevin A. Wang, Pierre Baldi, and Roy Fox · 2021
Later among the works it cites.
Gradients are not all you need
Luke Metz, C. Daniel Freeman, Samuel S. Schoenholz, and Tal Kachman · 2021
Later among the works it cites.
Multi-agent reinforcement learning in OpenSpiel: A reproduction report
Michael Walton and Viliam Lisy · 2021
Later among the works it cites.
A theoretical and empirical comparison of gradient approximations in derivative-free optimization
Albert S. Berahas, Liyuan Cao, Krzysztof Choromanski, and Katya Scheinberg · 2022
Later among the works it cites.
Computing Bayes Nash equilibrium strategies in auction games via simultaneous online dual averaging
Martin Bichler, Max Fichtl, and Matthias Oberlechner · 2022
Later among the works it cites.
Exploitability minimization in games and beyond
Denizalp Goktas and Amy Greenwald · 2022
Later among the works it cites.
Approximate exploitability: Learning a best response
Finbarr Timbers, Nolan Bard, Edward Lockhart, Marc Lanctot, Martin Schmid, Neil Burch, Julian Schrittwieser, Thomas Hubert, and Michael Bowling · 2022
Later among the works it cites.
Learning equilibria in asymmetric auction games
Martin Bichler, Nils Kohring, and Stefan Heidekrüger · 2023
Later among the works it cites.
Flax: A neural network library and ecosystem for JAX, 2023
Jonathan Heek, Anselm Levskaya, Avital Oliver, Marvin Ritter, Bertrand Rondepierre, Andreas Steiner, and Marc van Zee · 2023
Later among the works it cites.
Multiple oracle algorithm to solve continuous games
Tomáš Kroupa and Tomáš Votroubek · 2023
Later among the works it cites.
Finding mixed-strategy equilibria of continuous-action games without gradients using randomized policy networks
Carlos Martin and Tuomas Sandholm · 2023
Later among the works it cites.