Fetching the paper…
Reading the bibliography…
Contemporary applications of machine learning in two-team e-sports and the superior expressivity of multi-agent generative adversarial networks raise important and overlooked theoretical questions regarding optimization in two-team games.
Zur theorie der gesellschaftsspiele
John Von Neumann · 1928
Earlier work this paper cites.
An iterative method of solving a game
Julia Robinson · 1951
Earlier work this paper cites.
Elements for a theory of teams
Jakob Marschak · 1955
Earlier work this paper cites.
An analog of the minimax theorem for vector payoffs
David Blackwell · 1956
Earlier work this paper cites.
A class of games possessing pure-strategy Nash equilibria
R.W. Rosenthal · 1973
Earlier work this paper cites.
J. marschak and roy radner,” economic theory of teams”(book review)
Hans W Gottinger · 1974
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
GM Korpelevich · 1976
Earlier work this paper cites.
A modification of the arrow-hurwicz method for search of saddle points
Leonid Denisovich Popov · 1980
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
Arkadij Semenovič Nemirovskij and David Borisovich Yudin · 1983
Earlier work this paper cites.
Jean tirole game theory, 1991
Drew Fudenberg · 1991
Earlier work this paper cites.
The complexity of the lin–kernighan heuristic for the traveling salesman problem
Christos H Papadimitriou · 1992
Earlier work this paper cites.
The evolution of multilocus systems under weak selection
Thomas Nagylaki · 1993
Earlier work this paper cites.
Potential games
Dov Monderer and Lloyd S Shapley · 1996
Earlier work this paper cites.
On the control of dynamic systems with unknown operating point
A. S. Bazanella, P. V. Kokotovic, and A. S. e Silva · 1997
Earlier work this paper cites.
Team-maxmin equilibria
Bernhard von Stengel and Daphne Koller · 1997
Earlier work this paper cites.
Interactive team reasoning: A contribution to the theory of co-operation
Michael Bacharach · 1999
Earlier work this paper cites.
On prediction of individual sequences
N. Cesa-Bianchi and G. Lugosi · 1999
Earlier work this paper cites.
On the control of dynamic systems with unknown operating point
Alexandre S. Bazanella, Petar V. Kokotovic, and Aguinaldo S. E Silva · 2000
Earlier work this paper cites.
Playing large games using simple strategies
Richard J Lipton, Evangelos Markakis, and Aranyak Mehta · 2003
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.
The complexity of pure nash equilibria
Alex Fabrikant, Christos Papadimitriou, and Kunal Talwar · 2004
Earlier work this paper cites.
Washout filters in feedback control: Benefits, limitations and extensions
Munther A Hassouneh, Hsien-Chiarn Lee, and Eyad H Abed · 2004
Earlier work this paper cites.
Emergence of cooperation and evolutionary stability in finite populations
Martin A Nowak, Akira Sasaki, Christine Taylor, and Drew Fudenberg · 2004
Earlier work this paper cites.
Introduction: Teamwork in theory and in practice
Natalie Gold · 2005
Earlier work this paper cites.
Co-coercivity and its role in the convergence of iterative schemes for solving variational inequalities
Dao Li Zhu and Patrice Marcotte · 2005
Earlier work this paper cites.
The game world is flat: The complexity of nash equilibria in succinct games
Constantinos Daskalakis, Alex Fabrikant, and Christos H Papadimitriou · 2006
Earlier work this paper cites.
The myth of the folk theorem
Christian Borgs, Jennifer Chayes, Nicole Immorlica, Adam Tauman Kalai, Vahab Mirrokni, and Christos Papadimitriou · 2008
Earlier work this paper cites.
Congestion games with malicious players
Moshe Babaioff, Robert Kleinberg, and Christos H Papadimitriou · 2009
Earlier work this paper cites.
The complexity of computing a nash equilibrium
Constantinos Daskalakis, Paul W Goldberg, and Christos H Papadimitriou · 2009
Cited alongside, same era.
Multiplicative updates outperform generic no-regret learning in congestion games
R. Kleinberg, G. Piliouras, and É. Tardos · 2009
Cited alongside, same era.
Intrinsic robustness of the price of anarchy
Tim Roughgarden · 2009
Cited alongside, same era.
Convex games in banach spaces
Karthik Sridharan and Ambuj Tewari · 2010
Cited alongside, same era.
Continuous local search
Constantinos Daskalakis and Christos Papadimitriou · 2011
Cited alongside, same era.
Near-optimal no-regret algorithms for zero-sum games
Constantinos Daskalakis, Alan Deckelbaum, and Anthony Kim · 2011
Cited alongside, same era.
Mgan: Training generative adversarial nets with multiple generators
Quan Hoang, Tu Dinh Nguyen, Trung Le, and Dinh Phung · 2018
Later among the works it cites.
Cycles in adversarial regularized learning
Panayotis Mertikopoulos, Christos Papadimitriou, and Georgios Piliouras · 2018
Later among the works it cites.
Adversarial regression with multiple learners
Liang Tong, Sixie Yu, Scott Alfeld, et al · 2018
Later among the works it cites.
Stackelberg gan: Towards provable minimax equilibrium via multi-generator architectures
Hongyang Zhang, Susu Xu, Jiantao Jiao, Pengtao Xie, Ruslan Salakhutdinov, and Eric P Xing · 2018
Later among the works it cites.
Multi-objective training of generative adversarial networks with multiple discriminators
Isabela Albuquerque, João Monteiro, Thang Doan, Breandan Considine, Tiago Falk, and Ioannis Mitliagkas · 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…
Mohammad Sal Moslehian · 2011
Cited alongside, same era.
The multiplicative weights update method: a meta-algorithm and applications
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2012
Cited alongside, same era.
An overview of recent progress in the study of distributed multi-agent coordination
Yongcan Cao, Wenwu Yu, Wei Ren, and Guanrong Chen · 2012
Cited alongside, same era.
Online optimization with gradual variations
Chao-Kai Chiang, Tianbao Yang, Chia-Jung Lee, Mehrdad Mahdavi, Chi-Jen Lu, Rong Jin, and Shenghuo Zhu · 2012
Cited alongside, same era.
Learning from an optimization viewpoint
Karthik Sridharan · 2012
Cited alongside, same era.
No-regret dynamics and fictitious play
Yannick Viossat and Andriy Zapechelnyuk · 2013
Cited alongside, same era.
Last-iterate convergence: Zero-sum games and constrained min-max optimization
Constantinos Daskalakis and Ioannis Panageas · 2019
Later among the works it cites.
Md-gan: Multi-discriminator generative adversarial networks for distributed datasets
Corentin Hardy, Erwan Le Merrer, and Bruno Sericola · 2019
Later among the works it cites.
Human-level performance in 3d multiplayer games with population-based reinforcement learning
Max Jaderberg, Wojciech M Czarnecki, Iain Dunning, Luke Marris, Guy Lever, Antonio Garcia Castaneda, Charles Beattie, Neil C Rabinowitz, Ari S Morcos, Avraham Ruderman, et al · 2019
Later among the works it cites.
A theory of games played by teams of players
Jeongbin Kim, Thomas R Palfrey, and Jeffrey R Zeidel · 2019
Later among the works it cites.
First-order methods almost always avoid strict saddle points
Jason D. Lee, Ioannis Panageas, Georgios Piliouras, Max Simchowitz, Michael I. Jordan, and Benjamin Recht · 2019
Later among the works it cites.
Mad-gan: Multivariate anomaly detection for time series data with generative adversarial networks
Dan Li, Dacheng Chen, Baihong Jin, Lei Shi, Jonathan Goh, and See-Kiong Ng · 2019
Later among the works it cites.
Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile
Panayotis Mertikopoulos, Houssam Zenati, Bruno Lecouat, Chuan-Sheng Foo, Vijay Chandrasekhar, and Georgios Piliouras · 2019
Later among the works it cites.
The duality gap for two-team zero-sum games
Leonard J. Schulman and Umesh V. Vazirani · 2019
Later among the works it cites.
Learning distributed cooperative policies for security games via deep reinforcement learning
Hassam Ullah Sheikh, Mina Razghandi, and Ladislau Boloni · 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.
Poincaré recurrence, cycles and spurious equilibria in gradient-descent-ascent for non-convex non-concave zero-sum games
Emmanouil-Vasileios Vlatakis-Gkaragkounis, Lampros Flokas, and Georgios Piliouras · 2019
Later among the works it cites.
Tight last-iterate convergence rates for no-regret learning in multi-player games
Noah Golowich, Sarath Pattathil, and Constantinos Daskalakis · 2020
Later among the works it cites.
On gradient descent ascent for nonconvex-concave minimax problems
Tianyi Lin, Chi Jin, and Michael Jordan · 2020
Later among the works it cites.
Lessons learned from the training of gans on artificial datasets
Shichang Tang · 2020
Later among the works it cites.
Converging to team-maxmin equilibria in zero-sum multiplayer games
Youzhi Zhang and Bo An · 2020
Later among the works it cites.
Computing ex ante coordinated team-maxmin equilibria in zero-sum multiplayer extensive-form games
Youzhi Zhang, Bo An, and Jakub Černỳ · 2020
Later among the works it cites.
Settling the complexity of nash equilibrium in congestion games
Yakov Babichenko and Aviad Rubinstein · 2021
Closest in time.
Multi-agent coordination in adversarial environments through signal mediated strategies
Federico Cacciamani, Andrea Celli, Marco Ciccone, and Nicola Gatti · 2021
Closest in time.
The complexity of constrained min-max optimization
Constantinos Daskalakis, Stratis Skoulakis, and Manolis Zampetakis · 2021
Closest in time.
Efficient methods for structured nonconvex-nonconcave min-max optimization
Jelena Diakonikolas, Constantinos Daskalakis, and Michael I Jordan · 2021
Closest in time.
The complexity of gradient descent: 𝖢𝖫𝖲 = 𝖯𝖯𝖠𝖣 ∩ 𝖯𝖫𝖲 \mathsf{CLS}=\mathsf{PPAD}\cap\mathsf{PLS}
John Fearnley, Paul W Goldberg, Alexandros Hollender, and Rahul Savani · 2021
Closest in time.
Solving min-max optimization with hidden structure via gradient descent ascent
Lampros Flokas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, and Georgios Piliouras · 2021
Closest in time.
Sample-based approximation of nash in large many-player games via gradient descent
Ian Gemp, Rahul Savani, Marc Lanctot, Yoram Bachrach, Thomas Anthony, Richard Everett, Andrea Tacchetti, Tom Eccles, and János Kramár · 2021
Closest in time.