Equilibrium Results for Dynamic Congestion Games

Consider the following game. Given a network with a continuum of users at some origins, suppose that users wish to reach specic destinations, but that they are not indierent to the cost to reach them. They may have multiple possible routes, but their choices modify the travel costs on the network. Hence, each user faces the following problem: given a pattern of travel costs for the dierent possible routes that reach the destination, nd a path of minimal cost. This kind of game belongs to the class of congestion games. In the traditional, static approach travel times are assumed constant during the period of the game. In the present paper, we consider the so-called dynamic case where the time-varying nature of the trac conditions is explicitly taken into account. In transportation science, the question of whether there is an equilibrium and how to compute it for such a model is referred to as the dynamic user equilibrium problem. Until now, there was no general model for this problem. T...

• Type: Journal
• Year: 2010
• Where: TRANSCI
• Authors: Frédéric Meunier, Nicolas Wagner
• Keywords: Dynamic User Equilibrium, Hardware, Possible Routes, TRANSCI 2010, User Equilibrium Problem