Learning Sparse Graphon Mean Field Games
Christian Fabian, Kai Cui, Heinz Koeppl

TL;DR
This paper introduces LPGMFGs, a new formulation of graphon mean field games using $L^p$ graphons, enabling scalable analysis and solution approximation for sparse and power law networks in multi-agent systems.
Contribution
It extends GMFGs to sparse networks with $L^p$ graphons, providing theoretical guarantees and an efficient learning algorithm for large-scale multi-agent problems.
Findings
LPGMFGs accurately approximate solutions for sparse networks.
The extended OMD algorithm accelerates learning in large systems.
Empirical results confirm the approach's effectiveness on power law networks.
Abstract
Although the field of multi-agent reinforcement learning (MARL) has made considerable progress in the last years, solving systems with a large number of agents remains a hard challenge. Graphon mean field games (GMFGs) enable the scalable analysis of MARL problems that are otherwise intractable. By the mathematical structure of graphons, this approach is limited to dense graphs which are insufficient to describe many real-world networks such as power law graphs. Our paper introduces a novel formulation of GMFGs, called LPGMFGs, which leverages the graph theoretical concept of graphons and provides a machine learning tool to efficiently and accurately approximate solutions for sparse network problems. This especially includes power law networks which are empirically observed in various application areas and cannot be captured by standard graphons. We derive theoretical existence…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReinforcement Learning in Robotics · Game Theory and Applications · Advanced Bandit Algorithms Research
