Sampling equilibria: fast no-regret learning in structured games

DOI10.1137/1.9781611977554.CH149MaRDI QIDQ6538684zbMATH OpenFDO

Authors Max Hopkins, Daniel M. Kane, Si-Han Liu, Shachar Lovett

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977554.CH149

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• Algorithms and complexity for computing Nash equilibria in adversarial team games
• On the complexity of computing sparse equilibria and lower bounds for no-regret learning in games

This page was built for publication: Sampling equilibria: fast no-regret learning in structured games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538684)