arXiv Analytics

Sign in

arXiv:1907.10968 [math.OC]AbstractReferencesReviewsResources

Submodular Mean Field Games: Existence and Approximation of Solutions

Jodi Dianetti, Giorgio Ferrari, Markus Fischer, Max Nendel

Published 2019-07-25Version 1

We study mean field games with scalar It{\^o}-type dynamics and costs that are submodular with respect to a suitable order relation on the state and measure space. The submodularity assumption has a number of interesting consequences. Firstly, it allows us to prove existence of solutions via an application of Tarski's fixed point theorem, covering cases with discontinuous dependence on the measure variable. Secondly, it ensures that the set of solutions enjoys a lattice structure: in particular, there exist a minimal and a maximal solution. Thirdly, it guarantees that those two solutions can be obtained through a simple learning procedure based on the iterations of the best-response-map. The mean field game is first defined over ordinary stochastic controls, then extended to relaxed controls. Our approach allows also to treat a class of submodular mean field games with common noise in which the representative player at equilibrium interacts with the (conditional) mean of its state's distribution.

Related articles: Most relevant | Search more
arXiv:1812.09884 [math.OC] (Published 2018-12-24)
Nonzero-Sum Submodular Monotone-Follower Games: Existence and Approximation of Nash Equilibria
arXiv:2201.07850 [math.OC] (Published 2022-01-19)
A unifying framework for submodular mean field games
arXiv:1508.06496 [math.OC] (Published 2015-08-26)
Approximations of Stochastic Hybrid Systems: A Compositional Approach