Fast convergence of optimistic gradient ascent in network zero-sum extensive form games
From MaRDI portal
Publication:6164523
DOI10.1007/978-3-031-15714-1_22zbMath1520.91082arXiv2207.08426OpenAlexW4296009053MaRDI QIDQ6164523
Stratis Skoulakis, Lillian J. Ratliff, Georgios Piliouras, Ryann Sim
Publication date: 28 July 2023
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.08426
Noncooperative games (91A10) 2-person games (91A05) Games involving graphs (91A43) Games in extensive form (91A18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random extensive form games
- Non-cooperative games
- Exploration-exploitation in multi-agent learning: catastrophe theory meets game theory
- Zero-Sum Polymatrix Games: A Generalization of Minmax
- Smoothing Techniques for Computing Nash Equilibria of Sequential Games
- Contributions to the Theory of Games (AM-28), Volume II
- Superhuman AI for heads-up no-limit poker: Libratus beats top professionals
- On a Network Generalization of the Minmax Theorem
- Extensive Games
- Introduction to Online Convex Optimization
This page was built for publication: Fast convergence of optimistic gradient ascent in network zero-sum extensive form games