8 problems

Robustness conjecture. The same effects should be present in more realistic simulations and even in monotonicity-violating real traffic systems.

Greedy approximation conjecture. A greedy approximation algorithm similar to the algorithm in Hoffmann's Proposition 2.17 should also be designable.

Let $S$ be the set of autonomous vehicles in the mixed traffic system, let $J_1(S)=-\lVert \mathbf{G}_1(S)\rVert_2^2$ be the negative squared $\mathcal{H}_2$ norm of the transfer f…

In the simulation of circular roads approximated by regular polygons with $50$ edges, the theoretical and simulated maximum-flow values $z^{\text{max}}$ show a small mismatch. Poly…

Consider routings in the set of BANE, in a network with altruistic autonomous users, and let the equilibrium roads be the roads used at equilibrium. BANE minimum-equilibrium-roads…

An urban traffic network consists of roads and traffic intersections, and vehicles include autonomous vehicles (AVs). AV infrastructure conjecture. As autonomous-vehicle demand inc…

A traffic network contains links connecting intersections, and vehicles may be legacy or autonomous. A blue phase is an autonomous-vehicle-restricted signal phase, used alongside t…

Let ${\cal P}$ be a regular polling policy, and let $\lambda_1$ and $\lambda_2$ be the intensities of the arrival processes in lanes $1$ and $2$, respectively. Let $s$ be the servi…