Fetching the paper…
Reading the bibliography…
Mean field games (MFGs) model interactions in large-population multi-agent systems through population distributions.
Strongly ergodic Markov chains and rates of convergence using spectral conditions
Dean Isaacson and Glenn R. Luecke · 1978
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
Arkadij Semenovič Nemirovskij and David Borisovich Yudin · 1983
Earlier work this paper cites.
An analysis of temporal-difference learning with function approximation
J.N. Tsitsiklis and B. Van Roy · 1997
Earlier work this paper cites.
Sensitivity and convergence of uniformly ergodic Markov chains
A Yu Mitrophanov · 2005
Earlier work this paper cites.
Large population stochastic dynamic games: Closed-loop McKean-Vlasov systems and the Nash certainty equivalence principle
Minyi Huang, Roland P Malhamé, and Peter E Caines · 2006
Earlier work this paper cites.
Mean field games
Jean-Michel Lasry and Pierre-Louis Lions · 2007
Earlier work this paper cites.
An analysis of reinforcement learning with function approximation
Francisco S Melo, Sean P Meyn, and M Isabel Ribeiro · 2008
Earlier work this paper cites.
Population games and evolutionary dynamics
William H Sandholm · 2010
Earlier work this paper cites.
On a mean field game approach modeling congestion and aversion in pedestrian crowds
Aimé Lachapelle and Marie-Therese Wolfram · 2011
Earlier work this paper cites.
Markov Chains and Stochastic Stability
Sean P. Meyn and Richard L. Tweedie · 2012
Earlier work this paper cites.
Matrix analysis , volume 169
Rajendra Bhatia · 2013
Earlier work this paper cites.
Mean field games with nonlinear mobilities in pedestrian dynamics
Martin Burger, Marco Di Francesco, Peter Markowich, and Marie-Therese Wolfram · 2013
Earlier work this paper cites.
Nonasymptotic bounds on the estimation error of mcmc algorithms
Krzysztof Łatuszyński, Błażej Miasojedow, and Wojciech Niemiro · 2013
Earlier work this paper cites.
Fast projection onto the simplex and the l1 ball
Laurent Condat · 2016
Earlier work this paper cites.
Learning in mean field games: The fictitious play
Pierre Cardaliaguet and Saeed Hadikhanloo · 2017
Earlier work this paper cites.
On the properties of the softmax function with application in game theory and reinforcement learning
Bolin Gao and Lacra Pavel · 2017
Cited alongside, same era.
A finite time analysis of temporal difference learning with linear function approximation
Jalaj Bhandari, Daniel Russo, and Raghav Singal · 2018
Cited alongside, same era.
Evolution of cooperation in stochastic games
Christian Hilbe, Štěpán Šimsa, Krishnendu Chatterjee, and Martin A Nowak · 2018
Cited alongside, same era.
Reinforcement Learning: An Introduction
Richard S. Sutton and Andrew G. Barto · 2018
Cited alongside, same era.
Learning mean-field games
Xin Guo, Anran Hu, Renyuan Xu, and Junzi Zhang · 2019
Cited alongside, same era.
Finite-sample analysis for SARSA with linear function approximation
Learning while playing in mean-field games: Convergence and optimality
Qiaomin Xie, Zhuoran Yang, Zhaoran Wang, and Andreea Minca · 2021
Later among the works it cites.
Unified reinforcement Q-learning for mean field game and control problems
Andrea Angiuli, Jean-Pierre Fouque, and Mathieu Laurière · 2022
Later among the works it cites.
A survey on large-population systems and scalable multi-agent reinforcement learning
Kai Cui, Anam Tahir, Gizem Ekinci, Ahmed Elshamanhory, Yannick Eich, Mengguang Li, and Heinz Koeppl · 2022
Later among the works it cites.
A mean-field game approach to cloud resource management with function approximation
Weichao Mao, Haoran Qiu, Chen Wang, Hubertus Franke, Zbigniew Kalbarczyk, Ravishankar Iyer, and Tamer Basar · 2022
Later among the works it cites.
Q-learning in regularized mean-field games
Berkay Anahtarci, Can Deha Kariksiz, and Naci Saldi · 2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Shaofeng Zou, Tengyu Xu, and Yingbin Liang · 2019
Cited alongside, same era.
On the convergence of model free learning in mean field games
Romuald Elie, Julien Perolat, Mathieu Laurière, Matthieu Geist, and Olivier Pietquin · 2020
Cited alongside, same era.
Provably efficient reinforcement learning with linear function approximation
Chi Jin, Zhuoran Yang, Zhaoran Wang, and Michael I Jordan · 2020
Cited alongside, same era.
Fictitious play for mean field games: Continuous time analysis and applications
Sarah Perrin, Julien Pérolat, Mathieu Laurière, Matthieu Geist, Romuald Elie, and Olivier Pietquin · 2020
Cited alongside, same era.
Reinforcement learning in non-stationary discrete-time linear-quadratic mean-field games
Muhammad Aneeq Uz Zaman, Kaiqing Zhang, Erik Miehling, and Tamer Bașar · 2020
Cited alongside, same era.
Approximately solving mean field games via entropy-regularized deep reinforcement learning
Kai Cui and Heinz Koeppl · 2021
Cited alongside, same era.
Dynamic driving and routing games for autonomous vehicles on networks: A mean field game approach
Kuang Huang, Xu Chen, Xuan Di, and Qiang Du · 2021
Cited alongside, same era.
Andrea Angiuli, Jean-Pierre Fouque, Mathieu Laurière, and Mengrui Zhang · 2023
Later among the works it cites.
Policy mirror ascent for efficient and independent learning in mean field games
Batuhan Yardim, Semih Cayci, Matthieu Geist, and Niao He · 2023
Later among the works it cites.
Oracle-free reinforcement learning in mean-field games along a single sample path
Muhammad Aneeq Uz Zaman, Alec Koppel, Sujay Bhatt, and Tamer Basar · 2023
Later among the works it cites.
On the convergence of SARSA with linear function approximation
Shangtong Zhang, Remi Tachet Des Combes, and Romain Laroche · 2023
Later among the works it cites.
On the statistical efficiency of mean-field reinforcement learning with general function approximation
Jiawei Huang, Batuhan Yardim, and Niao He · 2024
Closest in time.
Is q-learning minimax optimal? a tight sample complexity analysis
Gen Li, Changxiao Cai, Yuxin Chen, Yuting Wei, and Yuejie Chi · 2024
Closest in time.
A game-theoretic framework for generic second-order traffic flow models using mean field games and adversarial inverse reinforcement learning
Zhaobin Mo, Xu Chen, Xuan Di, Elisa Iacomini, Chiara Segala, Michael Herty, and Mathieu Lauriere · 2024
Closest in time.
Graphon mean field games with a representative player: Analysis and learning algorithm
Fuzhong Zhou, Chenyu Zhang, Xu Chen, and Xuan Di · 2024
Closest in time.
Learning in herding mean field games: Single-loop algorithm with finite-time convergence analysis
Sihan Zeng, Sujay Bhatt, Alec Koppel, and Sumitra Ganesh · 2025
Closest in time.