A semi-Lagrangian scheme for First-Order Mean Field Games based on monotone operators
Abstract
We construct a semi-Lagrangian scheme for first-order, time-dependent, and non-local Mean Field Games. The convergence of the scheme to a weak solution of the system is analyzed by exploiting a key monotonicity property. To solve the resulting discrete problem, we implement a Learning Value Algorithm, prove its convergence, and propose an acceleration strategy based on a Policy iteration method. Finally, we present numerical experiments that validate the effectiveness of the proposed schemes and show that the accelerated version significantly improves performance.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.