Playing Anonymous Games using Simple Strategies

DOI10.1137/1.9781611974782.40zbMath1417.91017arXiv1608.07336OpenAlexW3138807128MaRDI QIDQ4575777

Ilias Diakonikolas, Alistair Stewart, Yu Cheng

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.07336

zbMATH Keywords

computational complexityapproximate Nash equilibriaanonymous games

Mathematics Subject Classification ID

Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

The Lipschitz constant of perturbed anonymous games ⋮ Query complexity of approximate equilibria in anonymous games ⋮ The Poisson Multinomial Distribution and Its Applications in Voting Theory, Ecological Inference, and Machine Learning ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Playing Anonymous Games using Simple Strategies