Solving N-player dynamic routing games with congestion: a mean field
approach

Solving N-player dynamic routing games with congestion: a mean field approach

22 October 2021

Mathieu Lauriere

Julien Perolat

Sertan Girgin

Sarah Perrin

Olivier Pietquin

Alexandre M. Bayen

Eric Goubault

Romuald Elie

Papers citing "Solving N-player dynamic routing games with congestion: a mean field approach"

5 / 5 papers shown

Title
Steering No-Regret Agents in MFGs under Model Uncertainty Leo Widmer Jiawei Huang Niao He LLMSV 93 1 0 12 Mar 2025
A Survey on Large-Population Systems and Scalable Multi-Agent Reinforcement Learning Kai Cui Anam Tahir Gizem Ekinci Ahmed Elshamanhory Yannick Eich Mengguang Li Heinz Koeppl AI4CE 118 15 0 08 Sep 2022
Scaling up Mean Field Games with Online Mirror Descent Julien Perolat Sarah Perrin Romuald Elie Mathieu Laurière Georgios Piliouras Matthieu Geist K. Tuyls Olivier Pietquin LRM AI4CE 92 46 0 28 Feb 2021
OpenSpiel: A Framework for Reinforcement Learning in Games Marc Lanctot Edward Lockhart Jean-Baptiste Lespiau V. Zambaldi Satyaki Upadhyay ... Julian Schrittwieser Thomas W. Anthony Edward Hughes Ivo Danihelka Jonah Ryan-Davis OffRL 92 250 0 26 Aug 2019
Deep Reinforcement Learning from Self-Play in Imperfect-Information Games Johannes Heinrich David Silver SSL 48 401 0 03 Mar 2016