Several problems in transportation and communication networks lead to the notion of Wardrop equilibrium. There exists a large number of algorithms to find Wardrop equilibria, both centralized and distributed. This paper presents a distributed control algorithm, which converges to a Wardrop equilibrium, derived from the algorithm presented in Fischer and Vöcking (2009). The innovation lies in the fact that convergence results are obtained considering that communications occur over time-varying communication graphs, with mild assumptions on the graph connectivity in time (uniform connectivity).
Wardrop equilibrium on time-varying graphs
Suraci V.Membro del Collaboration Group
2017-01-01
Abstract
Several problems in transportation and communication networks lead to the notion of Wardrop equilibrium. There exists a large number of algorithms to find Wardrop equilibria, both centralized and distributed. This paper presents a distributed control algorithm, which converges to a Wardrop equilibrium, derived from the algorithm presented in Fischer and Vöcking (2009). The innovation lies in the fact that convergence results are obtained considering that communications occur over time-varying communication graphs, with mild assumptions on the graph connectivity in time (uniform connectivity).File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
