[1] D. Fudenberg and D. K. Levine, The Theory of Learning in Games. Economic Learning and Social Evolution Series, MIT Press, 1998.
[2] D. Fudenberg and D. K. Levine, “Learning and equilibrium,” Annual Review of Economics, vol. 1, no. 1, pp. 385–420, 2009.
[3] S. Hart, "Adaptive heuristics," Econometrica, vol. 73, no. 5, pp. 1401-1430, 2005.
[4] H. Young, Strategic Learning and its Limits. Arne Ryde memorial lectures, Oxford University Press, 2004.
[5] S. Hart and A. Mas-Colell, "A simple adaptive procedure leading to correlated equilibrium," Econometrica, vol. 68, no. 5, pp. 1127-1150, 2000.
[6] U. Berger, "Fictitious play in  $2 \times n$  games," Journal of Economic Theory, vol. 120, no. 2, pp. 139-154, 2005.
[7] D. Monderer and L. S. Shapley, “Fictitious play property for games with identical interests,” Journal of Economic Theory, vol. 68, no. 1, pp. 258–265, 1996.
[8] J. S. Shamma and G. Arslan, “Unified convergence proofs of continuous-time fictitious play,” IEEE Transactions on Automatic Control, vol. 49, no. 7, pp. 1137–1141, 2004.
[9] L. S. Shapley, "Some topics in two-person games," in Advances in Game Theory (L. Shapley, M. Dresher, and A. Tucker, eds.), pp. 1-29, Princeton, NJ: Princeton University Press, 1964.
[10] D. P. Foster and H. Young, “On the nonconvergence of fictitious play in coordination games,” Games and Economic Behavior, vol. 25, no. 1, pp. 79–96, 1998.
[11] D. P. Foster and R. V. Vohra, “Calibrated learning and correlated equilibrium,” Games and Economic Behavior, vol. 21, no. 1, pp. 40–55, 1997.
[12] G. Piliouras and J. S. Shamma, “Optimization despite chaos: Convex relaxations to complex limit sets via Poincaré recurrence,” in Proceedings of the 2014 Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 861–873, 2014.
[13] H. P. Young, Individual Strategy and Social Structure: An Evolutionary Theory of Institutions. Princeton University Press, 1998.
[14] S. Hart and A. Mas-Colell, Simple Adaptive Strategies. WORLD SCIENTIFIC, 2013.
[15] C. Daskalakis, P. W. Goldberg, and C. H. Papadimitriou, “The complexity of computing a Nash equilibrium,” SIAM Journal on Computing, vol. 39, no. 1, pp. 195–259, 2009.
[16] Y. Babichenko and A. Rubinstein, "Communication complexity of approximate Nash equilibria," Games and Economic Behavior, vol. 134, pp. 376-398, 2022.
[17] S. Hart and A. Mas-Colell, "Uncoupled dynamics do not lead to Nash equilibrium," American Economic Review, vol. 93, pp. 1830-1836, December 2003.
[18] E.-V. Vlatakis-Gkaragkounis, L. Flokas, T. Lianeas, P. Mertikopoulos, and G. Piliouras, “No-regret learning and mixed Nash equilibria: They do not mix,” in Advances in Neural Information Processing Systems (H. Larochelle, M. Ranzato, R. Hadsell, M. Balcan, and H. Lin, eds.), vol. 33, pp. 1380–1391, Curran Associates, Inc., 2020.
[19] J. Millionis, C. Papadimitriou, G. Piliouras, and K. Spendlove, "An impossibility theorem in game dynamics," Proceedings of the National Academy of Sciences, vol. 120, no. 41, 2023.
[20] J. S. Shamma and G. Arslan, "Dynamic fictitious play, dynamic gradient play, and distributed convergence to Nash equilibria," IEEE Transactions on Automatic Control, vol. 50, pp. 312-327, March 2005.
[21] M. Muehlebach and M. I. Jordan, "Optimization with momentum: Dynamical, control-theoretic, and symplectic perspectives," J. Mach. Learn. Res., vol. 22, no. 1, 2021.