Communication complexity of approximate Nash equilibria-Reference-Cited by-同舟云学术

Communication complexity of approximate Nash equilibria

Published:2017-06-19 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Babichenko Yakov¹,Rubinstein Aviad²

Affiliation:

1. Technion, Israel

2. University of California at Berkeley, USA

Funder

Israel Science Foundation

John Templeton Foundation

National Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3055399.3055407

Reference44 articles.

1. {AGJ + 17} Anurag Anshu Naresh B Goud Rahul Jain Srijita Kundu and Priyanka Mukhopadhyay. Lifting randomized query complexity to randomized communication complexity. arXiv preprint arXiv:1703.07521 2017. {AGJ + 17} Anurag Anshu Naresh B Goud Rahul Jain Srijita Kundu and Priyanka Mukhopadhyay. Lifting randomized query complexity to randomized communication complexity. arXiv preprint arXiv:1703.07521 2017.

2. On notions of information transfer in VLSI circuits

3. Completely uncoupled dynamics and Nash equilibria

4. Query complexity of approximate nash equilibria

5. Query Complexity of Correlated Equilibrium

Cited by 30 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast Swap Regret Minimization and Applications to Approximate Correlated Equilibria;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Adapting to an accelerating, disruptive future;The Routledge International Handbook of Work-Integrated Learning;2023-04-27

3. Neural implementation of computational mechanisms underlying the continuous trade-off between cooperation and competition;Nature Communications;2022-11-11

4. Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

5. On Communication Complexity of Fixed Point Computation;ACM Transactions on Economics and Computation;2021-12-31