IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v48y2023i2p914-941.html

Multiagent Online Learning in Time-Varying Games

Author

Listed:
  • Benoit Duvocelle

    (Department of Quantitative Economics, Maastricht University, NL–6200 MD Maastricht, Netherlands)

  • Panayotis Mertikopoulos

    (Université Grenoble Alpes, CNRS, Inria, Grenoble INP, LIG, 38000 Grenoble, France; Criteo AI Lab, 38130 Echirolles, France)

  • Mathias Staudigl

    (Department of Advanced Computing Sciences, Maastricht University, NL–6200 MD Maastricht, Netherlands)

  • Dries Vermeulen

    (Department of Quantitative Economics, Maastricht University, NL–6200 MD Maastricht, Netherlands)

Abstract

We examine the long-run behavior of multiagent online learning in games that evolve over time. Specifically, we focus on a wide class of policies based on mirror descent, and we show that the induced sequence of play (a) converges to a Nash equilibrium in time-varying games that stabilize in the long run to a strictly monotone limit, and (b) it stays asymptotically close to the evolving equilibrium of the sequence of stage games (assuming they are strongly monotone). Our results apply to both gradient- and payoff-based feedback—that is, when players only get to observe the payoffs of their chosen actions.

Suggested Citation

  • Benoit Duvocelle & Panayotis Mertikopoulos & Mathias Staudigl & Dries Vermeulen, 2023. "Multiagent Online Learning in Time-Varying Games," Mathematics of Operations Research, INFORMS, vol. 48(2), pages 914-941, May.
    • Handle: RePEc:inm:ormoor:v:48:y:2023:i:2:p:914-941
    DOI: 10.1287/moor.2022.1283
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.1283
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2022.1283?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Bervoets, Sebastian & Bravo, Mario & Faure, Mathieu, 2020. "Learning with minimal information in continuous games," Theoretical Economics, Econometric Society, vol. 15(4), November.
    2. Perkins, S. & Leslie, D.S., 2014. "Stochastic fictitious play with continuous action sets," Journal of Economic Theory, Elsevier, vol. 152(C), pages 179-213.
    3. Erev, Ido & Roth, Alvin E, 1998. "Predicting How People Play Games: Reinforcement Learning in Experimental Games with Unique, Mixed Strategy Equilibria," American Economic Review, American Economic Association, vol. 88(4), pages 848-881, September.
    4. Cominetti, Roberto & Melo, Emerson & Sorin, Sylvain, 2010. "A payoff-based learning procedure and its application to traffic games," Games and Economic Behavior, Elsevier, vol. 70(1), pages 71-83, September.
    5. Beggs, A.W., 2005. "On the convergence of reinforcement learning," Journal of Economic Theory, Elsevier, vol. 122(1), pages 1-36, May.
    6. Michel Benaim & Josef Hofbauer & Sylvain Sorin, 2005. "Stochastic Approximations and Differential Inclusions II: Applications," Levine's Bibliography 784828000000000098, UCLA Department of Economics.
    7. Pierre Coucheney & Bruno Gaujal & Panayotis Mertikopoulos, 2015. "Penalty-Regulated Dynamics and Robust Learning Procedures in Games," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 611-633, March.
    8. Michel Benaïm & Josef Hofbauer & Sylvain Sorin, 2005. "Stochastic Approximations and Differential Inclusions; Part II: Applications," Working Papers hal-00242974, HAL.
    9. Sylvain Sorin & Cheng Wan, 2016. "Finite composite games: Equilibria and dynamics," Post-Print hal-02885860, HAL.
    10. Bravo, Mario & Mertikopoulos, Panayotis, 2017. "On the robustness of learning in games with stochastically perturbed payoff observations," Games and Economic Behavior, Elsevier, vol. 103(C), pages 41-66.
    11. Hofbauer, Josef & Sandholm, William H., 2009. "Stable games and their dynamics," Journal of Economic Theory, Elsevier, vol. 144(4), pages 1665-1693.4, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Panayotis Mertikopoulos & William H. Sandholm, 2016. "Learning in Games via Reinforcement and Regularization," Mathematics of Operations Research, INFORMS, vol. 41(4), pages 1297-1324, November.
    2. Saeed Hadikhanloo & Rida Laraki & Panayotis Mertikopoulos & Sylvain Sorin, 2022. "Learning in nonatomic games, part Ⅰ: Finite action spaces and population games," Post-Print hal-03767995, HAL.
    3. Sylvain Sorin, 2023. "Continuous Time Learning Algorithms in Optimization and Game Theory," Dynamic Games and Applications, Springer, vol. 13(1), pages 3-24, March.
    4. Bravo, Mario & Mertikopoulos, Panayotis, 2017. "On the robustness of learning in games with stochastically perturbed payoff observations," Games and Economic Behavior, Elsevier, vol. 103(C), pages 41-66.
    5. Cominetti, Roberto & Melo, Emerson & Sorin, Sylvain, 2010. "A payoff-based learning procedure and its application to traffic games," Games and Economic Behavior, Elsevier, vol. 70(1), pages 71-83, September.
    6. Philippe Jehiel & Aviman Satpathy, 2024. "Coarse Q-learning: Indifference, Indeterminacy, and Instability," Papers 2412.09321, arXiv.org, revised May 2026.
    7. Manxi Wu & Saurabh Amin & Asuman Ozdaglar, 2021. "Multi-agent Bayesian Learning with Best Response Dynamics: Convergence and Stability," Papers 2109.00719, arXiv.org.
    8. Funai, Naoki, 2022. "Reinforcement learning with foregone payoff information in normal form games," Journal of Economic Behavior & Organization, Elsevier, vol. 200(C), pages 638-660.
    9. Naoki Funai, 2019. "Convergence results on stochastic adaptive learning," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 68(4), pages 907-934, November.
    10. Leslie, David S. & Collins, E.J., 2006. "Generalised weakened fictitious play," Games and Economic Behavior, Elsevier, vol. 56(2), pages 285-298, August.
    11. Masiliūnas, Aidas, 2023. "Learning in rent-seeking contests with payoff risk and foregone payoff information," Games and Economic Behavior, Elsevier, vol. 140(C), pages 50-72.
    12. Jonathan Newton, 2018. "Evolutionary Game Theory: A Renaissance," Games, MDPI, vol. 9(2), pages 1-67, May.
    13. Mertikopoulos, Panayotis & Sandholm, William H., 2018. "Riemannian game dynamics," Journal of Economic Theory, Elsevier, vol. 177(C), pages 315-364.
    14. Leslie, David S. & Perkins, Steven & Xu, Zibo, 2020. "Best-response dynamics in zero-sum stochastic games," Journal of Economic Theory, Elsevier, vol. 189(C).
    15. Mukherjee, Sayan & Roy, Souvik, 2025. "Regularized Bayesian best response learning in finite games," Games and Economic Behavior, Elsevier, vol. 149(C), pages 1-31.
    16. Jakub Bielawski & Thiparat Chotibut & Fryderyk Falniowski & Michal Misiurewicz & Georgios Piliouras, 2022. "Unpredictable dynamics in congestion games: memory loss can prevent chaos," Papers 2201.10992, arXiv.org, revised Jan 2022.
    17. Naoki Funai, 2013. "An Adaptive Learning Model in Coordination Games," Games, MDPI, vol. 4(4), pages 1-22, November.
    18. Mario Bravo, 2016. "An Adjusted Payoff-Based Procedure for Normal Form Games," Mathematics of Operations Research, INFORMS, vol. 41(4), pages 1469-1483, November.
    19. Sandholm, William H., 2015. "Population Games and Deterministic Evolutionary Dynamics," Handbook of Game Theory with Economic Applications,, Elsevier.
    20. Viossat, Yannick & Zapechelnyuk, Andriy, 2013. "No-regret dynamics and fictitious play," Journal of Economic Theory, Elsevier, vol. 148(2), pages 825-842.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormoor:v:48:y:2023:i:2:p:914-941. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.