Retour aux activités
Séminaire informel de théorie des systèmes (ISS)

Mean field games on sparse graphs using graphons, Lp graphons and graphexes


31 mai 2024   10h30 — 11h30

Kai Cui Technical University of Darmstadt, Allemagne

Kai Cui

Séminaire hybride à l'Université McGill ou Zoom.

In this talk, we consider mean field games on graphs in discrete time. Here, each node corresponds to a single agent, and agent interaction is through their neighborhoods. We begin by reiterating graphon mean field games on dense graphs. There, we show a computational reduction thereof to standard mean field games, as well as a propagation of chaos to motivate the limiting system. We also extend results to sparser graphs via Lp graphons, and more recently via graphex mean field games for significantly more realistic, sparse graphs. Finally, we briefly give an outlook on our recent reinforcement learning algorithms for mean field control, which could be an avenue for future graphical extensions.

Bio: I am a fifth year PhD candidate at the Self-Organizing Systems Lab under supervision of Professor Heinz Koeppl at Technische Universität Darmstadt. My research focuses on multi-agent reinforcement learning, mean-field games and applications thereof. Prior to the PhD studies, I received my MSc degrees in Computer Science as well as Electrical Engineering and Information Technology at Technische Universität Darmstadt.

Peter E. Caines responsable
Aditya Mahajan responsable
Shuang Gao responsable
Borna Sayedana responsable
Alex Dunyak responsable


Salle MC 437
Pavillon McConnell
Université McGill
3480, rue University
Montréal QC H3A 0E9

Organisme associé

Centre for intelligent machines (CIM)