Solving dynamic user equilibrium by mean field routing game with explicit congestion dynamics

This work introduces a new N-player dynamic routing game that extend current Markovian traffic static assignment model.
It extends the N-player dynamic routing game to the corresponding mean field routing game, which models congestion in its dynamics.
Therefore, this new mean field routing game does not need to model congestion in the player cost function as done in the existing literature.
Both games are implemented in the open source library OpenSpiel.
The mean field game is used to solve the N-player dynamic game which leads to efficient computation of a approximate dynamic user equilibrium of the dynamic routing game.