Funder
Mexican National Council of Science and Technology
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference18 articles.
1. Azrieli, Y., Shmaya, E.: Lipschitz games. Math. Oper. Res. 38(2), 350–357 (2013)
2. Babichenko, Y.: Best-reply dynamics in large binary-choice anonymous games. Games and Economic Behavior 81, 130–144 (2013)
3. Babichenko, Y.: Query complexity of approximate Nash equilibria. In: Proceedings of 46th STOC, pp. 535–544 (2014)
4. Babichenko, Y., Barman, S.: Query complexity of correlated equilibrium. ACM Trans. Econ. Comput. 4(3), 22:1–22:9 (2015)
5. Chen, X., Cheng, Y., Tang, B.: Well-supported versus approximate nash equilibria: query complexity of large games. arXiv: 1511.00785 (2015)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献