Communication complexity of approximate Nash equilibria

DOI10.1145/3055399.3055407MaRDI QIDQ6828054zbMATH OpenFDO

Authors Yakov Babichenko, Aviad Rubinstein

Publication date 17 August 2017

Published in Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

zbMATH Keywords

convergence ratecommunication complexityapproximate Nash equilibriauncoupled dynamics

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Noncooperative games (91A10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

This page was built for publication: Communication complexity of approximate Nash equilibria

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