Fetching the paper…
Reading the bibliography…
Mean field games (MFGs) provide a mathematically tractable framework for modelling large-scale multi-agent systems by leveraging mean field theory to simplify interactions among agents.
Approximately Solving Mean Field Games via Entropy-Regularized Deep Reinforcement Learning. In International Conference on Artificial Intelligence and Statistics . PMLR, 1909–1917
Kai Cui and Heinz Koeppl. 2021 · 1917
Earlier work this paper cites.
Some topics in two-person games
Lloyd Shapley. 1964 · 1964
Earlier work this paper cites.
Game theory
Drew Fudenberg and Jean Tirole. 1991 · 1991
Earlier work this paper cites.
Policy invariance under reward transformations: Theory and application to reward shaping. In ICML , Vol. 99. 278–287
Andrew Y Ng, Daishi Harada, and Stuart Russell. 1999 · 1999
Earlier work this paper cites.
Algorithms for Inverse Reinforcement Learning. In Proceedings of the Seventeenth International Conference on Machine Learning . 663–670
Andrew Y Ng and Stuart J Russell. 2000 · 2000
Earlier work this paper cites.
Software Engineering for Large-Scale Multi-Agent Systems Research Issues and Practical Applications. In Conference proceedings SELMAS . Springer, 154
Alessandro Garcia, Carlos Lucena, Franco Zambonelli, Andrea Omicini, and Jaelson Castro. 2002 · 2002
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é, Peter E Caines, et al · 2006
Earlier work this paper cites.
Maximum margin planning. In Proceedings of the 23rd International Conference on Machine Learning . 729–736
Nathan D Ratliff, J Andrew Bagnell, and Martin A Zinkevich. 2006 · 2006
Earlier work this paper cites.
Mean field games
Jean-Michel Lasry and Pierre-Louis Lions. 2007 · 2007
Earlier work this paper cites.
Maximum entropy inverse reinforcement learning. In Proceedings of the 23rd AAAI Conference on Artificial Intelligence . 1433–1438
Brian D Ziebart, Andrew Maas, J Andrew Bagnell, and Anind K Dey. 2008 · 2008
Earlier work this paper cites.
The complexity of computing a Nash equilibrium
Constantinos Daskalakis, Paul W Goldberg, and Christos H Papadimitriou. 2009 · 2009
Earlier work this paper cites.
Discrete time, finite state space mean field games
Diogo A Gomes, Joana Mohr, and Rafael Rigao Souza. 2010 · 2010
Earlier work this paper cites.
Multi-agent inverse reinforcement learning. In 2010 ninth international conference on machine learning and applications . IEEE, 395–400
Sriraam Natarajan, Gautam Kunapuli, Kshitij Judah, Prasad Tadepalli, Kristian Kersting, and Jude Shavlik. 2010 · 2010
Earlier work this paper cites.
Computational methods for oblivious equilibrium
Gabriel Y Weintraub, C Lanier Benkard, and Benjamin Van Roy. 2010 · 2010
Earlier work this paper cites.
Modeling interaction via the principle of maximum causal entropy. In Proceedings of the 27th International Conference on Machine Learning . 1255–1262
Brian D Ziebart, J Andrew Bagnell, and Anind K Dey. 2010 · 2010
Earlier work this paper cites.
Theoretical considerations of potential-based reward shaping for multi-agent systems. In The 10th International Conference on Autonomous Agents and Multiagent Systems . ACM, 225–232
Sam Devlin and Daniel Kudenko. 2011 · 2011
Cited alongside, same era.
Information, utility and bounded rationality. In International Conference on Artificial General Intelligence . Springer, 269–274
Daniel Alexander Ortega and Pedro Alejandro Braun. 2011 · 2011
Cited alongside, same era.
Control of McKean–Vlasov dynamics versus mean field games
René Carmona, François Delarue, and Aimé Lachapelle. 2013 · 2013
Cited alongside, same era.
Bounded-rationality models: tasks to become intellectually competitive
Ronald M Harstad and Reinhard Selten. 2013 · 2013
Cited alongside, same era.
A sparsity-based model of bounded rationality
Xavier Gabaix. 2014 · 2014
Cited alongside, same era.
Reinforcement learning in stationary mean-field games. In Proceedings of the 18th International Conference on Autonomous Agents and Multi-agent Systems . 251–259
Jayakumar Subramanian and Aditya Mahajan. 2019 · 2019
Later among the works it cites.
Meta-inverse reinforcement learning with probabilistic context variables
Lantao Yu, Tianhe Yu, Chelsea Finn, and Stefano Ermon. 2019b · 2019
Later among the works it cites.
Factorized q-learning for large-scale multi-agent systems. In Proceedings of the First International Conference on Distributed Artificial Intelligence . 1–7
Ming Zhou, Yong Chen, Ying Wen, Yaodong Yang, Yufeng Su, Weinan Zhang, Dell Zhang, and Jun Wang. 2019 · 2019
Later among the works it cites.
Q-learning in regularized mean-field games
Berkay Anahtarci, Can Deha Kariksiz, and Naci Saldi. 2020 · 2020
Later among the works it cites.
On the Convergence of Model Free Learning in Mean Field Games.. In Thirty-Fourth AAAI Conference on Artificial Intelligence . 7143–7150
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. 2014 · 2014
Cited alongside, same era.
Mean field stochastic games: Monotone costs and threshold policies. In 2016 IEEE 55th Conference on Decision and Control (CDC) . IEEE, 7105–7110
Minyi Huang and Yan Ma. 2016 · 2016
Cited alongside, same era.
Learning in mean field games: the fictitious play
Pierre Cardaliaguet and Saeed Hadikhanloo. 2017 · 2017
Cited alongside, same era.
Reinforcement learning with deep energy-based policies. In International Conference on Machine Learning . PMLR, 1352–1361
Tuomas Haarnoja, Haoran Tang, Pieter Abbeel, and Sergey Levine. 2017 · 2017
Cited alongside, same era.
Mean field stochastic games with binary actions: Stationary threshold policies. In 2017 IEEE 56th Annual Conference on Decision and Control (CDC) . IEEE, 27–32
Minyi Huang and Yan Ma. 2017 · 2017
Cited alongside, same era.
Learning Robust Rewards with Adverserial Inverse Reinforcement Learning. In International Conference on Learning Representations
Justin Fu, Katie Luo, and Sergey Levine. 2018 · 2018
Cited alongside, same era.
Markov–Nash Equilibria in Mean-Field Games with Discounted Cost
Naci Saldi, Tamer Basar, and Maxim Raginsky. 2018 · 2018
Cited alongside, same era.
Romuald Elie, Julien Pérolat, Mathieu Laurière, Matthieu Geist, and Olivier Pietquin. 2020 · 2020
Later among the works it cites.
Entropy regularization for mean field games with learning
Xin Guo, Renyuan Xu, and Thaleia Zariphopoulou. 2020 · 2020
Later among the works it cites.
Stochastic games
Yehuda John Levy and Eilon Solan. 2020 · 2020
Later among the works it cites.
Multi Type Mean Field Reinforcement Learning. In Proceedings of the 19th International Conference on Autonomous Agents and Multi-agent Systems . 411–419
Sriram Subramanian, Pascal Poupart, Matthew E Taylor, and Nidhi Hegde. 2020 · 2020
Later among the works it cites.
Evaluating Strategic Structures in Multi-Agent Inverse Reinforcement Learning
Justin Fu, Andrea Tacchetti, Julien Perolat, and Yoram Bachrach. 2021 · 2021
Closest in time.
Reinforcement learning for mean field games with strategic complementarities. In International Conference on Artificial Intelligence and Statistics . PMLR, 2458–2466
Kiyeob Lee, Desik Rengarajan, Dileep Kalathil, and Srinivas Shakkottai. 2021 · 2021
Closest in time.
Learning while playing in mean-field games: Convergence and optimality. In International Conference on Machine Learning . PMLR, 11436–11447
Qiaomin Xie, Zhuoran Yang, Zhaoran Wang, and Andreea Minca. 2021 · 2021
Closest in time.
Individual-level inverse reinforcement learning for mean field games. In Proceedings of the 21st International Conference on Autonomous Agents and Multi-agent Systems
Yang Chen, Libo Zhang, Jiamou Liu, and Shuyue Hu. 2022 · 2022
Closest in time.
Generalization in mean field games by learning master policies. In Proceedings of the AAAI Conference on Artificial Intelligence , Vol. 36. 9413–9421
Sarah Perrin, Mathieu Laurière, Julien Pérolat, Romuald Élie, Matthieu Geist, and Olivier Pietquin. 2022 · 2022
Closest in time.
Delay-dependent rendezvous and flocking of large scale multi-agent systems with communication delays. In 2008 47th IEEE Conference on Decision and Control . IEEE, 2038–2043
Ulrich Munz, Antonis Papachristodoulou, and Frank Allgower. 2008 · 2043
Closest in time.