Funder
Engineering and Physical Sciences Research Council
Economic and Social Research Council
European Research Council
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference28 articles.
1. Austrin, P., Braverman, M., Chlamtac, E.: Inapproximability of NP-complete variants of Nash equilibrium. Theory Comput. 9, 117–142 (2013)
2. Babichenko, Y., Barman, S., Peretz, R.: Simple approximate equilibria in large games. In: ACM Conference on Economics and Computation, EC’14, Stanford , CA, USA, June 8–12, 2014, pp. 753–770 (2014)
3. Bosse, H., Byrka, J., Markakis, E.: New algorithms for approximate Nash equilibria in bimatrix games. Theor. Comput. Sci. 411(1), 164–173 (2010)
4. Briest, P., Goldberg, P.W., Röglin, H.: Approximate equilibria in games with few players. CoRR (2008). arXiv:0804.4524
5. Cai, Y., Daskalakis, C.: On minmax theorems for multiplayer games. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011, pp. 217–234 (2011)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献