Traffic Theory

A Necessary and Sufficient Condition for the Existence of Potential Functions for Heterogeneous Routing Games

Farokhi, Farhad
Krichene, Walid
Bayen, Alexandre M.
Johansson, Karl H.
2014

We study a heterogeneous routing game in which vehicles might belong to more than one type. The type determines the cost of traveling along an edge as a function of the flow of various types of vehicles over that edge. We relax the assumptions needed for the existence of a Nash equilibrium in this heterogeneous routing game. We extend the available results to present necessary and sufficient conditions for the existence of a potential function. We characterize a set of tolls that guarantee the existence of a potential function when only two types of users are participating in the game. We...

Stackelberg Routing on Parallel Networks With Horizontal Queues

Krichene, Walid
Reilly, Jack
Amin, Saurabh
Bayen, Alexandre M.
2014

This paper presents a game theoretic framework for studying Stackelberg routing games on parallel networks with horizontal queues, such as transportation networks. First, we introduce a new class of latency functions that models congestion due to the formation of physical queues. For this new class, some results from the classical congestion games literature (in which latency is assumed to be a non-decreasing function of the flow) do not hold. In particular, we find that there may exist multiple Nash equilibria that have different total costs. We provide a simple polynomial-time algorithm...

On the Convergence of No-Regret Learning in Selfish Routing

Krichene, Walid
Drighès, Benjamin
Bayen, Alexandre
2014

We study the repeated, non-atomic routing game, in which selfish players make a sequence of routing decisions. We consider a model in which players use regret-minimizing algorithms as the learning mechanism, and study the resulting dynamics. We are concerned in particular with the convergence to the set of Nash equilibria of the routing game. No-regret learning algorithms are known to guarantee convergence of a subsequence of population strategies. We are concerned with convergence of the actual sequence. We show that convergence holds for a large class of online learning algorithms,...

Anatomy of a Crash

Marzuoli, Aude
Boidot, Emmanuel
Feron, Eric
Erp, Paul B. C. van
Ucko, Alexis
Bayen, Alexandre M.
2014

Transportation networks constitute a critical infrastructure enabling the transfers of passengers and goods, with a significant impact on the economy at different scales. Transportation modes, whether air, road or rail, are coupled and interdependent. The frequent occurrence of perturbations on one or several modes disrupts passengers' entire journeys, directly and through ripple effects. The present paper provides a case report of the Asiana Crash in San Francisco International Airport on July 6th 2013 and its repercussions on the multimodal transportation network. It studies the...

Stability of Nash Equilibria in the Congestion Game Under Replicator Dynamics

Drighès, Benjamin
Krichene, Walid
Bayen, Alexandre M.
2014

We consider the single commodity non-atomic congestion game, in which the player population is assumed to obey the replicator dynamics. We study the resulting rest points, and relate them to the Nash equilibria of the one-shot congestion game. The rest points of the replicator dynamics, also called evolutionary stable points, are known to coincide with a superset of Nash equilibria, called restricted equilibria. By studying the spectrum of the linearized system around rest points, we show that Nash equilibria are locally asymptotically stable stationary points. We also show that under the...

Accelerated Mirror Descent in Continuous and Discrete Time

Krichene, Walid
Bayen, Alexandre
Bartlett, Peter L
2015

We study accelerated mirror descent dynamics in continuous and discrete time. Combining the original continuous-time motivation of mirror descent with a recent ODE interpretation of Nesterov's accelerated method, we propose a family of continuous-time descent dynamics for convex functions with Lipschitz gradients, such that the solution trajectories are guaranteed to converge to the optimum at a O(1/t...

Solving the Dynamic User Equilibrium Problem Via Sequential Convex Optimization for Parallel Horizontal Queuing Networks

Lespiau, Jean-Baptiste
Samaranayake, Samitha
Bayen, Alexandre M.
2015

This article considers the dynamic user equilibrium (DUE) problem for parallel networks. The network dynamics are modeled using a Godunov discretization of the Lighthill-Williams-Richards partial differential equation with a trapezoidal flux function. The model is augmented with an additional constraint that prevents vehicle holding which is a flaw in the discretization. The departure rates are assumed to be fixed. Under these assumptions, the authors show that the future allocation of the demand among the different paths at the origin has no effect on the travel time of the vehicles...

Projected Sub-Gradient with ℓ 1 or Simplex Constraints via Isotonic Regression

Thai, Jérôme
Wu, Cathy
Pozdnukhov, Alexey
Bayen, Alexandre
2015

We consider two classic problems in convex optimization: 1) minimizing a convex objective over the nonnegative orthant of the ℓ1-ball and 2) minimizing a convex objective over the probability simplex. We propose an efficient and simple equality constraint elimination technique which converts the ℓ1 and simplex constraints into order constraints. We formulate the projection onto the feasible set as an isotonic regression problem, which can be solved exactly in O(n) time via the Pool Adjacent Violators Algorithm (PAVA), where n is the...

Variational Lagrangian Data Assimilation in Open Channel Networks

Wu, Qingfang
Tinka, Andrew
Weekly, Kevin
Beard, Jonathan
Bayen, Alexandre M.
2015

This article presents a data assimilation method in a tidal system, where data from both Lagrangian drifters and Eulerian flow sensors were fused to estimate water velocity. The system is modeled by first-order, hyperbolic partial differential equations subject to periodic forcing. The estimation problem can then be formulated as the minimization of the difference between the observed variables and model outputs, and eventually provide the velocity and water stage of the hydrodynamic system. The governing equations are linearized and discretized using an implicit discretization scheme,...

Link Density Inference from Cellular Infrastructure

Yadlowsky, Steve
Thai, Jérôme
Wu, Cathy
Pozdnukov, Alexey
Bayen, Alexandre
2015

This work explores the problem of estimating road link densities from cellular tower signals by mobile subscribers in urban areas. The authors pose the estimation problem as a quadratic program, and present a robust framework that produces vehicle density estimates and is suitable for large-scale problems. The authors demonstrate that both simple and sophisticated models of cellular network connections can be handled robustly by the framework, without sacrificing efficiency or scalability. The authors present a numerical experiment on the I-15 corridor in San Diego based on a...