29 Apr 2021 12:30-13:30
Some mean field game problems on networks: optimal visiting and optimal routing.
Fabio Bagagiolo, Università degli Studi di Trento
Abstract.
In this talk I present some results about the problem of optimal visiting (touching) a certain number of given targets, and about the optimal routing for an origin-destination problem. Both models are studied in the framework of the so-called mean field games theory. A mean field game is a situation where many agents (even infinitely many) control their own trajectory in order to optimize a cost that depends on the mean distribution of all other agents.
for the link to the teams meeting clic here