On the Resilience of Traffic Networks under Non-Equilibrium Learning
Reviewed by Pithpith:K53ADAZHopen to challenge →
read the original abstract
We investigate the resilience of learning-based \textit{Intelligent Navigation Systems} (INS) to informational flow attacks, which exploit the vulnerabilities of IT infrastructure and manipulate traffic condition data. To this end, we propose the notion of \textit{Wardrop Non-Equilibrium Solution} (WANES), which captures the finite-time behavior of dynamic traffic flow adaptation under a learning process. The proposed non-equilibrium solution, characterized by target sets and measurement functions, evaluates the outcome of learning under a bounded number of rounds of interactions, and it pertains to and generalizes the concept of approximate equilibrium. Leveraging finite-time analysis methods, we discover that under the mirror descent (MD) online-learning framework, the traffic flow trajectory is capable of restoring to the Wardrop non-equilibrium solution after a bounded INS attack. The resulting performance loss is of order $\tilde{\mathcal{O}}(T^{\beta})$ ($-\frac{1}{2} \leq \beta < 0 )$), with a constant dependent on the size of the traffic network, indicating the resilience of the MD-based INS. We corroborate the results using an evacuation case study on a Sioux-Fall transportation network.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Exit-and-Join Dynamics and Equilibrium in Continuum Cooperative Games
Develops continuum theory of exit-and-join coalition dynamics in nonatomic cooperative games, extending value concepts to derive mean-field dynamics and characterize equilibria equivalent to Wardrop equilibria.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.