Mean field optimization problems: stability results and Lagrangian discretization

Abstract

We formulate and investigate a mean field optimization (MFO) problem over a set of probability distributions μ with a prescribed marginal m. The cost function depends on an aggregate term, which is the expectation of μ with respect to a contribution function. This problem is of particular interest in the context of Lagrangian potential mean field games (MFGs) and their discretization. We provide a first-order optimality condition and prove strong duality. We investigate stability properties of the MFO problem with respect to the prescribed marginal, from both primal and dual perspectives. In our stability analysis, we propose a method for recovering an approximate solution to an MFO problem with the help of an approximate solution to an MFO with a different marginal m, typically an empirical distribution. We combine this method with the stochastic Frank-Wolfe algorithm of a previous publication of ours to derive a complete resolution method.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…