no code implementations • 22 Aug 2022 • Paul Muller, Romuald Elie, Mark Rowland, Mathieu Lauriere, Julien Perolat, Sarah Perrin, Matthieu Geist, Georgios Piliouras, Olivier Pietquin, Karl Tuyls
The designs of many large-scale systems today, from traffic routing environments to smart grids, rely on game-theoretic equilibrium concepts.
no code implementations • 25 May 2022 • Mathieu Laurière, Sarah Perrin, Julien Pérolat, Sertan Girgin, Paul Muller, Romuald Élie, Matthieu Geist, Olivier Pietquin
Non-cooperative and cooperative games with a very large number of players have many applications but remain generally intractable when the number of players increases.
no code implementations • 22 Mar 2022 • Mathieu Laurière, Sarah Perrin, Sertan Girgin, Paul Muller, Ayush Jain, Theophile Cabannes, Georgios Piliouras, Julien Pérolat, Romuald Élie, Olivier Pietquin, Matthieu Geist
One limiting factor to further scale up using RL is that existing algorithms to solve MFGs require the mixing of approximated quantities such as strategies or $q$-values.
no code implementations • 20 Sep 2021 • Sarah Perrin, Mathieu Laurière, Julien Pérolat, Romuald Élie, Matthieu Geist, Olivier Pietquin
Mean Field Games (MFGs) can potentially scale multi-agent systems to extremely large populations of agents.
no code implementations • 7 Jun 2021 • Matthieu Geist, Julien Pérolat, Mathieu Laurière, Romuald Elie, Sarah Perrin, Olivier Bachem, Rémi Munos, Olivier Pietquin
Mean-field Games (MFGs) are a continuous approximation of many-agent RL.
no code implementations • 17 May 2021 • Sarah Perrin, Mathieu Laurière, Julien Pérolat, Matthieu Geist, Romuald Élie, Olivier Pietquin
We present a method enabling a large number of agents to learn how to flock, which is a natural behavior observed in large populations of animals.
1 code implementation • 28 Feb 2021 • Julien Perolat, Sarah Perrin, Romuald Elie, Mathieu Laurière, Georgios Piliouras, Matthieu Geist, Karl Tuyls, Olivier Pietquin
We address scaling up equilibrium computation in Mean Field Games (MFGs) using Online Mirror Descent (OMD).
1 code implementation • NeurIPS 2020 • Sarah Perrin, Julien Perolat, Mathieu Laurière, Matthieu Geist, Romuald Elie, Olivier Pietquin
In this paper, we deepen the analysis of continuous time Fictitious Play learning algorithm to the consideration of various finite state Mean Field Game settings (finite horizon, $\gamma$-discounted), allowing in particular for the introduction of an additional common noise.
no code implementations • 23 Sep 2019 • Sarah Perrin, Thierry Roncalli
Nevertheless, very few models have succeeded in providing a real alternative solution to the Markowitz model.