Wardrop equilibrium on time-varying graphs. (October 2017)

• Record Type: Journal Article
• Authors: Pietrabissa, Antonio; Suraci, Vincenzo
• Is Part Of: Automatica. Volume 84(2017)
• Page Start: 159
• Page End: 165
• Publication Date: 2017-10
• Subjects: Wardrop equilibrium -- Load balancing -- Game theory -- Graph theory -- Switched systems; Automatic control -- Periodicals; Automation -- Periodicals; 629.805
• DOI: 10.1016/j.automatica.2017.07.021
• Languages: English
• ISSNs: 0005-1098

Abstract

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 ).