Query complexity of approximate nash equilibria-Reference-Cited by-同舟云学术

Query complexity of approximate nash equilibria

Published:2014-05-31 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the forty-sixth annual ACM symposium on Theory of computing
language:
Short-container-title:

Author:

Babichenko Yakov¹

Affiliation:

1. California Institute of Technology, California

Funder

Walter S. Baer and Jeri Weiss fellowship

Division of Computing and Communication Foundations

Powell Foundation

Publisher

ACM

Link

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

Reference29 articles.

1. Babichenko Y. (2013) "Query Complexity of Approximate Nash Equilibria " arXiv:1306.6686. Babichenko Y. (2013) "Query Complexity of Approximate Nash Equilibria " arXiv:1306.6686.

2. Babichenko Y. and Barman S. (2013) "Query Complexity of Correlated Equilibrium " arXiv:1306.2437. Babichenko Y. and Barman S. (2013) "Query Complexity of Correlated Equilibrium " arXiv:1306.2437.

3. Babichenko Y. and Peretz R. (2013) "Approximate Nash Equilibria Via Sampling " arXiv:1307.4934. Babichenko Y. and Peretz R. (2013) "Approximate Nash Equilibria Via Sampling " arXiv:1307.4934.

4. The Statistical Mechanics of Strategic Interaction

5. Chen X. and Deng X. (2006) "Settling the Complexity of Two-Player Nash Equilibrium " in 47th Annual IEEE Symposium on Foundations of Computer Science pp. 261--272. 10.1109/FOCS.2006.69 Chen X. and Deng X. (2006) "Settling the Complexity of Two-Player Nash Equilibrium " in 47th Annual IEEE Symposium on Foundations of Computer Science pp. 261--272. 10.1109/FOCS.2006.69

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

1. Communication complexity of approximate Nash equilibria;Games and Economic Behavior;2020-08

2. The query complexity of correlated equilibria;Games and Economic Behavior;2018-03

3. Logarithmic Query Complexity for Approximate Nash Computation in Large Games;Theory of Computing Systems;2018-02-17

4. Inapproximability of Nash Equilibrium;SIAM Journal on Computing;2018-01

5. Query complexity of approximate equilibria in anonymous games;Journal of Computer and System Sciences;2017-12