Multiagent Online Learning in Dynamic and Uncertain Environments

Published Online:https://doi.org/10.1287/educ.2026.0302
Endnotes

1 Another branch of game theory, not considered herein, is cooperative games (e.g., Peleg and Sudhölter [67]).

2 There are aj,aj′∈Aj such that gij(·,aj)≠gij(·,aj′).

3 See also the recent discussion on “preference graphs” in Biggar and Shames [12].

4 Weakly acyclic games also can be characterized by a potential-like function (see the supplemental appendix, Section A.2).

5 The stage index t may arise from a common clock, in which case all players act or a predefined or a random subset of players act at stage t, or from independent Poisson clocks, one per player, in which case t indexes the tth event across all clocks.

6 In Marden et al. [57], this revision mechanism is called JSFP with inertia.

7 Because there is only a single population, we do not use a subscript to specify the population index.

References

  • [1] A. Alacaoglu, L. Viano, N. He, and V. Cevher. A natural actor-critic framework for zero-sum Markov games. Proceedings of the 39th International Conference on Machine Learning, Proceedings of Machine Learning Research, volume 162. PMLR, 307–366, 2022.Google Scholar
  • [2] T. Alpcan and T. Başar. Network Security: A Decision and Game-Theoretic Approach. Cambridge University Press, Cambridge, UK, 2011.Google Scholar
  • [3] K. J. Arrow. Rationality of self and others in an economic system. Journal of Business 59(4):S385–S399, 1986.Crossref, Google Scholar
  • [4] Y. Arslantas, E. Yuceel, Y. Yalin, and M. O. Sayin. Convergence of heterogeneous learning dynamics in zero-sum stochastic games. IEEE Transactions on Automatic Control 70(11):7523–7537, 2025.Crossref, Google Scholar
  • [5] S. Aydin and C. Eksin. Policy gradient play over time-varying networks in Markov potential games. 2023 62nd IEEE Conference on Decision and Control. Institute of Electrical and Electronics Engineers, Piscataway, NJ, 1997–2002, 2023a.Google Scholar
  • [6] S. Aydin and C. Eksin. Policy gradient play with networked agents in Markov potential games. Proceedings of the Fifth Annual Learning for Dynamics and Control Conference, Proceedings of Machine Learning Research, volume 221. PMLR, 184–195, 2023b.Google Scholar
  • [7] S. Aydin and C. Eksin. Almost sure convergence of networked policy gradient over time-varying networks in Markov potential games. Preprint, submitted October 26, https://arxiv.org/abs/2410.20075, 2024.Google Scholar
  • [8] L. Baudin and R. Laraki. Fictitious play and best-response dynamics in identical interest and zero-sum stochastic games. Proceedings of the 39th International Conference on Machine Learning, Proceedings of Machine Learning Research, volume 162. PMLR, 1664–1690, 2022.Google Scholar
  • [9] S. Behnezhad, S. Dehghani, M. Derakhshan, M. Hajiaghayi, and S. Seddighin. Fast and simple solutions of Blotto games. Operations Research 71(2):506–516, 2023.Link, Google Scholar
  • [10] M. Benaïm. Dynamics of stochastic approximation algorithms. Séminaire de Probabilités XXXIII, Lecture Notes in Mathematics, volume 1709. Springer, Berlin, 1–68, 1999.Crossref, Google Scholar
  • [11] M. Benaïm and J. W. Weibull. Deterministic approximation of stochastic evolution in games. Econometrica 71(3):873–903, 2003.Crossref, Google Scholar
  • [12] O. Biggar and I. Shames. Preference graphs: A combinatorial tool for game theory. Preprint, submitted February 5, https://arxiv.org/abs/2502.03546, 2025.Google Scholar
  • [13] K. Bimpikis, O. Candogan, and D. Saban. Spatial pricing in ride-sharing networks. Operations Research 67(3):744–769, 2019.Link, Google Scholar
  • [14] L. E. Blume. The statistical mechanics of strategic interaction. Games and Economic Behavior 5(3):387–424, 1993.Crossref, Google Scholar
  • [15] S. Borenstein, J. B. Bushnell, and F. A. Wolak. Measuring market inefficiencies in California’s restructured wholesale electricity market. American Economic Review 92(5):1376–1405, 2002.Crossref, Google Scholar
  • [16] V. S. Borkar. Stochastic Approximation: A Dynamical Systems Viewpoint, Texts and Readings in Mathematics, volume 48. Hindustan Book Agency, New Delhi, India, 2008.Crossref, Google Scholar
  • [17] G. W. Brown. Iterative solution of games by fictitious play. T. C. Koopmans, editor. Activity Analysis of Production and Allocation. John Wiley and Sons, New York, 374–376, 1951.Google Scholar
  • [18] N. Brown and T. Sandholm. Superhuman AI for heads-up no-limit poker: Libratus beats top professionals. Science 359(6374):418–424, 2018.Crossref, Google Scholar
  • [19] G. P. Cachon and S. Netessine. Game theory in supply chain analysis. M. P. Johnson, B. Norman, and N. Secomandi, editors. Models, Methods and Applications for Innovative Decision Making, INFORMS TutORials in Operations Research. INFORMS, Catonsville, MD, 200–233, 2006.Link, Google Scholar
  • [20] Y. Cai, O. Candogan, C. Daskalakis, and C. Papadimitriou. Zero-sum polymatrix games: A generalization of minmax. Mathematics of Operations Research 41(2):648–655, 2016.Link, Google Scholar
  • [21] E. Calvano, G. Calzolari, V. Denicolò, and S. Pastorello. Artificial intelligence, algorithmic pricing, and collusion. American Economic Review 110(10):3267–3297, 2020.Crossref, Google Scholar
  • [22] N. Cesa-Bianchi and G. Lugosi. Prediction, Learning, and Games. Cambridge University Press, Cambridge, UK, 2006.Crossref, Google Scholar
  • [23] S. L. Chang, M. Piraveenan, P. Pattison, and M. Prokopenko. Game theoretic modelling of infectious disease dynamics and intervention methods: A mini-review. Preprint, submitted January 14, https://arxiv.org/abs/1901.04143, 2019.Google Scholar
  • [24] Z. Chen, K. Zhang, E. Mazumdar, A. Ozdaglar, and A. Wierman. A finite-sample analysis of payoff-based independent learning in zero-sum stochastic games. A. Oh, T. Naumann, A. Globerson, K. Saenko, M. Hardt, and S. Levine, editors. Advances in Neural Information Processing Systems, volume 36. Curran Associates, Red Hook, NY, 75826–75883, 2023.Crossref, Google Scholar
  • [25] C. Daskalakis, P. W. Goldberg, and C. H. Papadimitriou. The complexity of computing a Nash equilibrium. Communications of the ACM 52(2):89–97, 2009.Crossref, Google Scholar
  • [26] C. Daskalakis, N. Golowich, and K. Zhang. The complexity of Markov equilibrium in stochastic games. Proceedings of the 36th Annual Conference on Learning Theory, Proceedings of Machine Learning Research, volume 195. PMLR, 4180–4234, 2023.Google Scholar
  • [27] C. Daskalakis, A. Ilyas, V. Syrgkanis, and H. Zeng. Training GANs with optimism. Sixth International Conference on Learning Representations. International Conference on Learning Representations, 2018.Google Scholar
  • [28] D. Ding, C. Y. Wei, K. Zhang, and M. Jovanovic. Independent policy gradient for large-scale Markov potential games: Sharper rates, function approximation, and game-agnostic convergence. Proceedings of the 39th International Conference on Machine Learning, Proceedings of Machine Learning Research, volume 162. PMLR, 5166–5220, 2022.Google Scholar
  • [29] C. Eksin, J. S. Shamma, and J. S. Weitz. Disease dynamics in a stochastic network game: A little empathy goes a long way in averting outbreaks. Scientific Reports 7(1):44122, 2017.Crossref, Google Scholar
  • [30] S. R. Etesami, N. Kiyavash, V. Leon, and H. V. Poor. Optimal adversarial policies in the multiplicative learning system with a malicious expert. IEEE Transactions on Information Forensics and Security 16:2276–2287, 2021.Crossref, Google Scholar
  • [31] D. Fudenberg and D. K. Levine. Consistency and cautious fictitious play. Journal of Economic Dynamics and Control 19(5–7):1065–1089, 1995.Crossref, Google Scholar
  • [32] D. Fudenberg and D. K. Levine. The Theory of Learning in Games. MIT Press, Cambridge, MA, 1998.Google Scholar
  • [33] D. Fudenberg and D. K. Levine. Whither game theory? Towards a theory of learning in games. Journal of Economic Perspectives 30(4):151–170, 2016.Crossref, Google Scholar
  • [34] X. Guo, X. Li, and Y. Zhang. An α potential game framework for-player dynamic games. SIAM Journal on Control and Optimization 63(4):2964–3005, 2025.Crossref, Google Scholar
  • [35] L. Hammond, A. Chan, J. Clifton, J. Hoelscher-Obermaier, A. Khan, E. McLean, C. Smith, et al. Multi-agent risks from advanced AI. Preprint, submitted February 19, https://arxiv.org/abs/2502.14143, 2025.Google Scholar
  • [36] S. Hart and A. Mas-Colell. A simple adaptive procedure leading to correlated equilibrium. Econometrica 68(5):1127–1150, 2000.Crossref, Google Scholar
  • [37] S. Hart and A. Mas-Colell. Uncoupled dynamics do not lead to Nash equilibrium. American Economic Review 93(5):1830–1836, 2003.Crossref, Google Scholar
  • [38] S. Hart and A. Mas-Colell. Simple Adaptive Strategies: From Regret-Matching to Uncoupled Dynamics, World Scientific Series in Economic Theory, volume 4. World Scientific, Singapore, 2013.Crossref, Google Scholar
  • [39] E. Hazan. Introduction to online convex optimization. Foundations and Trends in Optimization 2(3–4):157–325, 2016.Crossref, Google Scholar
  • [40] B. Hobbs. Linear complementarity models of Nash-Cournot competition in bilateral and POOLCO power markets. IEEE Transactions on Power Systems 16(2):194–202, 2001.Crossref, Google Scholar
  • [41] J. Hofbauer and W. H. Sandholm. On the global convergence of stochastic fictitious play. Econometrica 70(6):2265–2294, 2002.Crossref, Google Scholar
  • [42] J. Hofbauer and K. Sigmund. Evolutionary Games and Population Dynamics. Cambridge University Press, Cambridge, UK, 1998.Crossref, Google Scholar
  • [43] L. Houghtalen, O. Ergun, and J. Sokol. Designing mechanisms for the management of carrier alliances. Transportation Science 45(4):465–482, 2011.Link, Google Scholar
  • [44] M. Kearns. Graphical games. N. Nisan, T. Roughgarden, É. Tardos, and V. V. Vazirani, editors. Algorithmic Game Theory. Cambridge University Press, Cambridge, UK, 2007.Crossref, Google Scholar
  • [45] H. K. Khalil. Nonlinear Systems, 3rd edition. Prentice Hall, Upper Saddle River, NJ, 2002.Google Scholar
  • [46] J. Kober, J. A. Bagnell, and J. Peters. Reinforcement learning in robotics: A survey. The International Journal of Robotics Research 32(11):1238–1274, 2013.Crossref, Google Scholar
  • [47] V. Krishna and T. Sjöström. Evolution and games: Replicator dynamics. S. Hart and A. Mas-Colell, editors. Cooperation: Game-Theoretic Approaches. Springer-Verlag, Berlin, 275–285, 1997.Crossref, Google Scholar
  • [48] S. Leonardos, W. Overman, I. Panageas, and G. Piliouras. Global convergence of multi-agent policy gradient in Markov potential games. Preprint, submitted June 3, https://arxiv.org/abs/2106.01969, 2021.Google Scholar
  • [49] D. S. Leslie and E. J. Collins. Individual Q-learning in normal form games. SIAM Journal on Control and Optimization 44(2):495–514, 2005.Crossref, Google Scholar
  • [50] T. Li, G. Peng, Q. Zhu, and T. Başar. The confluence of networks, games, and learning a game-theoretic framework for multiagent decision making over networks. IEEE Control Systems Magazine 42(4):35–67, 2022.Crossref, Google Scholar
  • [51] M. L. Littman. Markov games as a framework for multi-agent reinforcement learning. Proceedings of the 11th International Conference on Machine Learning. Elsevier, Amsterdam, 157–163, 1994.Google Scholar
  • [52] C. Maheshwari, M. Wu, D. Pai, and S. Sastry. Independent and decentralized learning in Markov potential games. IEEE Transactions on Automatic Control 70(11):7538–7553, 2025.Crossref, Google Scholar
  • [53] W. Mao, K. Zhang, R. Zhu, D. Simchi-Levi, and T. Başar. Model-free nonstationary reinforcement learning: Near-optimal regret and applications in multiagent reinforcement learning and inventory control. Management Science 71(2):1564–1580, 2025.Link, Google Scholar
  • [54] J. R. Marden and J. S. Shamma. Revisiting log-linear learning: Asynchrony, completeness and payoff-based implementation. Games and Economic Behavior 75(2):788–808, 2012.Crossref, Google Scholar
  • [55] J. R. Marden and J. S. Shamma. Game theory and distributed control. H. P. Young and S. Zamir, editors. Handbook of Game Theory with Economic Applications, volume 4. Elsevier, Amsterdam, 861–899, 2015.Google Scholar
  • [56] J. R. Marden and A. Wierman. Distributed welfare games. Operations Research 61(1):155–168, 2013.Link, Google Scholar
  • [57] J. R. Marden, G. Arslan, and J. S. Shamma. Joint strategy fictitious play with inertia for potential games. IEEE Transactions on Automatic Control 54(2):208–220, 2009b.Crossref, Google Scholar
  • [58] E. Mazumdar, L. J. Ratliff, M. I. Jordan, and S. S. Sastry. Policy-gradient algorithms have no guarantees of convergence in linear quadratic games. Preprint, submitted July 8, https://arxiv.org/abs/1907.03712, 2019.Google Scholar
  • [59] A. H. Mohsenian-Rad, V. W. Wong, J. Jatskevich, R. Schober, and A. Leon-Garcia. Autonomous demand-side management based on game-theoretic energy consumption scheduling for the future smart grid. IEEE Transactions on Smart Grid 1(3):320–331, 2010.Crossref, Google Scholar
  • [60] D. Monderer and L. S. Shapley. Potential games. Games and Economic Behavior 14(1):124–143, 1996Crossref, Google Scholar
  • [61] M. Muehlebach and M. I. Jordan. Optimization with momentum: Dynamical, control-theoretic, and symplectic perspectives. Journal of Machine Learning Research 22(73):1–50, 2021.Google Scholar
  • [62] A. Nagurney. Game theory and the COVID-pandemic. J. G. Carlsson, editor. Emerging Optimization Methods and Modeling Techniques with Applications, INFORMS TutORials in Operations Research. INFORMS, Catonsville, MD, 83–130, 2021.Link, Google Scholar
  • [63] K. Nakhleh, C. Eksin, and S. Ekin. Simulation-based optimistic policy iteration for multi-agent MDPs with Kullback-Leibler control cost. Preprint, submitted October 19, https://arxiv.org/abs/2410.15156, 2024.Google Scholar
  • [64] J. Nash. Equilibrium points in N-person games. Proceedings of the National Academy of Sciences of the United States of America 36(1):48–49, 1950.Crossref, Google Scholar
  • [65] J. Omic, A. Orda, and P. Van Mieghem. Protecting against network infections: A game theoretic perspective. IEEE INFOCOM. Institute of Electrical and Electronics Engineers, Piscataway, NJ, 1485–1493, 2009.Google Scholar
  • [66] C. Park, K. Zhang, and A. Ozdaglar. Multi-player zero-sum Markov games with networked separable interactions. A. Oh, T. Naumann, A. Globerson, K. Saenko, M. Hardt, and S. Levine, editors. Advances in Neural Information Processing Systems, volume 36. Curran Associates, Red Hook, NY, 37354–37369, 2023.Google Scholar
  • [67] B. Peleg and P. Sudhölter. Introduction to the Theory of Cooperative Games, Theory and Decision Library C, volume 34, 2nd edition. Springer, Berlin, 2007.Google Scholar
  • [68] G. Perakis and G. Roels. The price of anarchy in supply chains: Quantifying the efficiency of price-only contracts. Management Science 53(8):1249–1268, 2007.Link, Google Scholar
  • [69] B. Roberson. The Colonel Blotto game. Economic Theory 29(1):1–24, 2006.Crossref, Google Scholar
  • [70] J. Robinson. An iterative method of solving a game. Annals of Mathematics 54(2):296–301, 1951.Crossref, Google Scholar
  • [71] L. Samuelson. Evolutionary Games and Equilibrium Selection. MIT Press, Cambridge, MA, 1997.Google Scholar
  • [72] W. H. Sandholm. Pairwise comparison dynamics and evolutionary foundations for Nash equilibrium. Games 1(1):3–17, 2010a.Crossref, Google Scholar
  • [73] W. H. Sandholm. Population Games and Evolutionary Dynamics. MIT Press, Cambridge, MA, 2010b.Google Scholar
  • [74] W. H. Sandholm. Population games and deterministic evolutionary dynamics. P. Young and S. Zamir, editors. Handbook of Game Theory with Economic Applications, volume 4. Elsevier, Amsterdam, 703–778, 2015.Google Scholar
  • [75] E. E. Sauma and S. S. Oren. Proactive planning and valuation of transmission investments in restructured electricity markets. Journal of Regulatory Economics 30(3):358–387, 2006.Crossref, Google Scholar
  • [76] M. O. Sayin, F. Parise, and A. Ozdaglar. Fictitious play in zero-sum stochastic games. SIAM Journal on Control and Optimization 60(4):2095–2114, 2022a.Crossref, Google Scholar
  • [77] M. O. Sayin, K. Zhang, and A. Ozdaglar. Fictitious play in Markov games with single controller. Proceedings of the 23rd ACM Conference on Economics and Computation. Association for Computing Machinery, New York, 919–936, 2022b.Google Scholar
  • [78] M. O. Sayin, K. Zhang, D. Leslie, T. Basar, and A. Ozdaglar. Decentralized Q-learning in zero-sum Markov games. M. Ranzato, A. Beygelzimer, Y. Dauphin, P. S. Liang, and J. Wortman Vaughan, editors. Advances in Neural Information Processing Systems, volume 34. Curran Associates, Red Hook, NY, 18320–18334, 2021.Google Scholar
  • [79] S. Shalev-Shwartz, S. Shammah, and A. Shashua. Safe, multi-agent, reinforcement learning for autonomous driving. Preprint, submitted October 11, https://arxiv.org/abs/1610.03295, 2016.Google Scholar
  • [80] J. Shamma and G. Arslan. Unified convergence proofs of continuous-time fictitious play. IEEE Transactions on Automatic Control 49(7):1137–1141, 2004.Crossref, Google Scholar
  • [81] J. S. Shamma and G. Arslan. Dynamic fictitious play, dynamic gradient play, and distributed convergence to Nash equilibria. IEEE Transactions on Automatic Control 50(3):312–327, 2005.Crossref, Google Scholar
  • [82] L. S. Shapley. Stochastic games. Proceedings of the National Academy of Sciences of the United States of America 39(10):1095–1100, 1953.Crossref, Google Scholar
  • [83] L. S. Shapley. Some topics in two-person games. Advances in Game Theory 52:1–28, 1964.Google Scholar
  • [84] Y. Shoham, R. Powers, and T. Grenager. If multi-agent learning is the answer, what is the question? Artificial Intelligence 171(7):365–377, 2007.Crossref, Google Scholar
  • [85] A. Siddiq and T. A. Taylor. Ride-hailing platforms: Competition and autonomous vehicles. Manufacturing & Service Operations Management 24(3):1511–1528, 2022.Link, Google Scholar
  • [86] D. Silver, J. Schrittwieser, K. Simonyan, I. Antonoglou, A. Huang, A. Guez, T. Hubert, et al. Mastering the game of Go without human knowledge. Nature 550(7676):354–359, 2017.Crossref, Google Scholar
  • [87] B. Skyrms. Chaos and the explanatory significance of equilibrium: Strange attractors in evolutionary game dynamics. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association. Cambridge University Press, Cambridge, UK, 374–394, 1992.Google Scholar
  • [88] B. Skyrms. The Stag Hunt and the Evolution of Social Structure. Cambridge University Press, Cambridge, UK, 2004.Google Scholar
  • [89] S. Sorin. Replicator dynamics: Old and new. Journal of Dynamics and Games 7(4):365–386, 2020.Crossref, Google Scholar
  • [90] Y. Sun, T. Liu, R. Zhou, P. Kumar, and S. Shahrampour. Provably fast convergence of independent natural policy gradient for Markov potential games. A. Oh, T. Naumann, A. Globerson, K. Saenko, M. Hardt, and S. Levine, editors. Advances in Neural Information Processing Systems, volume 36. Curran Associates, Red Hook, NY, 43951–43971, 2023.Crossref, Google Scholar
  • [91] M. Tambe. Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned. Cambridge University Press, Cambridge, UK, 2011.Crossref, Google Scholar
  • [92] P. D. Taylor and L. B. Jonker. Evolutionary stable strategies and game dynamics. Mathematical Biosciences 40(1–2):145–156, 1978.Crossref, Google Scholar
  • [93] S. Toonsi and J. Shamma. Higher-order uncoupled dynamics do not lead to Nash equilibrium—Except when they do. A. Oh, T. Naumann, A. Globerson, K. Saenko, M. Hardt, and S. Levine, editors. Advances in Neural Information Processing Systems, volume 36. Curran Associates, Red Hook, NY, 30267–30285, 2023.Google Scholar
  • [94] M. Tripathy, J. Bai, and H. S. S. Heese. Driver collusion in ride-hailing platforms. Decision Sciences 54(4):434–446, 2023.Crossref, Google Scholar
  • [95] O. Unlu and M. O. Sayin. Episodic logit-Q dynamics for efficient learning in stochastic teams. 2023 62nd IEEE Conference on Decision and Control. Institute of Electrical and Electronics Engineers, Piscataway, NJ, 1985–1990, 2023.Google Scholar
  • [96] O. Vinyals, I. Babuschkin, W. M. Czarnecki, M. Mathieu, A. Dudzik, J. Chung, D. H. Choi, et al. Grandmaster level in Starcraft II using multi-agent reinforcement learning. Nature 575(7782):350–354, 2019.Crossref, Google Scholar
  • [97] X. Wang, H. Yang, and D. Zhu. Driver-rider cost-sharing strategies and equilibria in a ridesharing program. Transportation Science 52(4):868–881, 2018.Link, Google Scholar
  • [98] C. J. C. H. Watkins and P. Dayan. Q-learning. Machine Learning 8:279–292, 1992.Crossref, Google Scholar
  • [99] J. W. Weibull. Evolutionary Game Theory. MIT Press, Cambridge, MA, 1995.Google Scholar
  • [100] J. S. Weitz, S. W. Park, C. Eksin, and J. Dushoff. Awareness-driven behavior changes can shift the shape of epidemics away from peaks and toward plateaus, shoulders, and oscillations. Proceedings of the National Academy of Sciences of the United States of America 117(51):32764–32771, 2020.Crossref, Google Scholar
  • [101] J. S. Weitz, C. Eksin, K. Paarporn, S. P. Brown, and W. C. Ratcliff. An oscillating tragedy of the commons in replicator dynamics with game-environment feedback. Proceedings of the National Academy of Sciences of the United States of America 113(47):E7518–E7525, 2016.Google Scholar
  • [102] H. P. Young. The evolution of conventions. Econometrica 61(1):57–84, 1993.Crossref, Google Scholar
  • [103] H. P. Young. Individual Strategy and Social Structure. Princeton University Press, Princeton, NJ, 1998.Crossref, Google Scholar
  • [104] H. P. Young. Strategic Learning and Its Limits. Oxford University Press, Oxford, UK, 2004.Crossref, Google Scholar
  • [105] R. Zhang, Z. Ren, and N. Li. Gradient play in stochastic games: Stationary points, convergence, and sample complexity. IEEE Transactions on Automatic Control 69(10):6499–6514, 2024.Crossref, Google Scholar
  • [106] Z. Zhou, Z. Chen, Y. Lin, and A. Wierman. Convergence rates for localized actor-critic in networked Markov potential games. Proceedings of the 39th Conference on Uncertainty in Artificial Intelligence, Proceedings of Machine Learning Research, volume 216. PMLR, 2563–2573, 2023.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.