[19] H. Fang, N. J. Harvey, V. S. Portella, and M. P. Friedlander. Online mirror descent and dual averaging: Keeping pace in the dynamic case. Journal of Machine Learning Research, 23(1): 5271-5308, 2022.
[20] C. Finn, P. Abbeel, and S. Levine. Model-agnostic meta-learning for fast adaptation of deep networks. In International Conference on Machine Learning, pages 1126–1135, 2017.
[21] C. Finn, A. Rajeswaran, S. Kakade, and S. Levine. Online meta-learning. In International Conference on Machine Learning, pages 1920-1930. PMLR, 2019.
[22] R. Fox, S. M. Mcaleer, W. Overman, and I. Panageas. Independent natural policy gradient always converges in Markov potential games. In International Conference on Artificial Intelligence and Statistics, pages 4414-4425, 2022.
[23] Y. Freund and R. E. Schapire. Adaptive game playing using multiplicative weights. Games and Economic Behavior, 29(1-2):79-103, 1999.
[24] T. Furmston, G. Lever, and D. Barber. Approximate Newton methods for policy search in Markov decision processes. Journal of Machine Learning Research, 17, 2016.
[25] Z. Gao, Q. Ma, T. Başar, and J. R. Birge. Finite-sample analysis of decentralized Q-learning for stochastic games. arXiv preprint arXiv:2112.07859, 2021.
[26] A. Gupta, M. Lanctot, and A. Lazaridou. Dynamic population-based meta-learning for multiagent communication with natural language. Advances in Neural Information Processing Systems, 34:16899-16912, 2021.
[27] K. Harris, I. Anagnostides, G. Farina, M. Khodak, Z. S. Wu, and T. Sandholm. Meta-learning in games. arXiv preprint arXiv:2209.14110, 2022.
[28] E. Hazan. Introduction to online convex optimization. Foundations and Trends® in Optimization, 2(3-4):157-325, 2016.
[29] J. Humplik, A. Galashov, L. Hasenclever, P. A. Ortega, Y. W. Teh, and N. Heess. Meta reinforcement learning as task inference. arXiv preprint arXiv:1905.06424, 2019.
[30] K. Ji, J. Yang, and Y. Liang. Theoretical convergence of multi-step model-agnostic meta-learning. Journal of Machine Learning Research, 2022.
[31] H. Jia, B. Ding, H. Wang, X. Gong, and X. Zhou. Fast adaptation via meta learning in multiagent cooperative tasks. In Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing, pages 707-714, 2019.
[32] C. Jin, Z. Allen-Zhu, S. Bubeck, and M. I. Jordan. Is Q-learning provably efficient? Advances in Neural Information Processing Systems, 31, 2018.
[33] C. Jin, Q. Liu, Y. Wang, and T. Yu. V-learning-A simple, efficient, decentralized algorithm for multiagent RL. In ICLR Workshop on Gamification and Multiagent Solutions, 2022.
[34] V. Khattar, Y. Ding, B. Sel, J. Lavaei, and M. Jin. A CMDP-within-online framework for meta-safe reinforcement learning. In International Conference on Learning Representations, 2022.
[35] M. Khodak, M.-F. F. Balcan, and A. S. Talwalkar. Adaptive gradient-based meta-learning methods. Advances in Neural Information Processing Systems, 32, 2019.
[36] M. Lauer and M. Riedmiller. An algorithm for distributed reinforcement learning in cooperative multi-agent systems. In International Conference on Machine Learning, 2000.
[37] M. Lauriere, S. Perrin, S. Girgin, P. Muller, A. Jain, T. Cabannes, G. Piliouras, J. Pérolat, R. Elie, O. Pietquin, et al. Scalable deep reinforcement learning algorithms for mean field games. In International Conference on Machine Learning, pages 12078-12095. PMLR, 2022.
[38] S. Leonardos, W. Overman, I. Panageas, and G. Piliouras. Global convergence of multi-agent policy gradient in Markov potential games. arXiv preprint arXiv:2106.01969, 2021.