A library for mean-field games.
-
Updated
Nov 18, 2024 - Python
A library for mean-field games.
Mean-field solution for cooperative search games -- diffusive agents with costs on control, time and collisions.
Library for solving variational mean-field games using optimal transport and the Sinkhorn algorithm
Code for "A MFG Model for the Dynamics of Cities" (Barilla, Carlier, Lasry 2021)
Use optimal control theory to simulate the dynamics of crowds. Set up a room, initialise agents and their targets. The solution of a Hamilton-Jacobi-Bellman equation provides the optimal trajectories towards the goals, while the actual motion is simulated using an accurate social force model.
A framework for solving high-dimensional mean field games (MFG) with normalizing flows (NF) and regularizing NFs with MFG transport costs.
Implementation of Offline Munchausen Mirror Descent.
Personal website of Leo D'Amato
We use Deep Galerking Method (DGM) to solve the Non-Linear Schrödinger Formulation (NLSF) of a Mean-Field Game describing the passage of a cylindrical intruder through a dense crowd.
Add a description, image, and links to the mean-field-games topic page so that developers can more easily learn about it.
To associate your repository with the mean-field-games topic, visit your repo's landing page and select "manage topics."