Publisher
Springer International Publishing
Reference19 articles.
1. Bosse, H., Byrka, J., Markakis, E.: New algorithms for approximate nash equilibria in bimatrix games. Theor. Comput. Sci. 411(1), 164–173 (2010). https://doi.org/10.1016/j.tcs.2009.09.023
2. Brown, G.W.: Iterative solution of games by fictitious play. Act. Anal. Prod. Allocat. 13(1), 374–376 (1951)
3. Chen, X., Deng, X., Teng, S.H.: Settling the complexity of computing two-player nash equilibria. J. ACM 56(3), 1–57 (2009). https://doi.org/10.1145/1516512.1516516
4. Chen, Z., Deng, X., Huang, W., Li, H., Li, Y.: On tightness of the Tsaknakis-Spirakis algorithm for approximate nash equilibrium. CoRR abs/2107.01471 (2021). https://arxiv.org/abs/2107.01471
5. Conitzer, V.: Approximation guarantees for fictitious play. In: 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, September 2009. https://doi.org/10.1109/allerton.2009.5394918
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献