In this paper, we address the problem of modeling the tourists’ ﬂow in historic city centers whose narrow alleys are represented by a transportation network. We consider a mean ﬁled games approach where the standard forward backward system of equations is also intertwined with a tourists’ path preferences dynamics. The path preferences are inﬂuenced by the congestion status on the whole network as well as the possible hassle of being forced to run during the tour. We prove the existence of a mean ﬁeld game equilibrium as a ﬁxed point, over a suitable set of time-varying distributions, of a map obtained as a limit of a sequence of approximating functions. Then, a bi-level optimization problem is formulated for an external controller who aims to induce a speciﬁc mean ﬁeld game equilibrium.
|Titolo:||A mean field approach to model flows of agents with path preferences over a network|
|Data di pubblicazione:||Being printed|
|Appare nelle tipologie:||4.1 Articolo in Atti di convegno|
File in questo prodotto:
|root_final.pdf||Pre-print||Documento in Pre-print||Accesso chiuso-personale||Riservato|