Solving the road congestion problem is one of the most pressing issues in modern cities
since it causes time wasting, pollution, higher industrial costs and huge road maintenance …

Despite the simplicity and practicality of (deterministic) fundamental diagram models in
highway traffic flow theory, the wide scattering effect observed in empirical data remains …

Computational tractability and social welfare (aka. efficiency) of equilibria are two
fundamental but in general orthogonal considerations in algorithmic game theory …

We examine an adaptive learning framework for nonatomic congestion games where the
players' cost functions may be subject to exogenous fluctuations (eg, due to disturbances in …

In a social system, the self-interest of agents can be detrimental to the collective good,
sometimes leading to social dilemmas. To resolve such a conflict, a central designer may …

This paper proposes AlphaRoute, an AlphaGo inspired algorithm for coordinating large-
scale routes, built upon graph attention reinforcement learning and Monte Carlo Tree …

We consider the problem of minimizing social cost in atomic congestion games and show,
perhaps surprisingly, that efficiently computed taxation mechanisms yield the same …

We consider a largely untapped potential for the improvement of traffic networks that is
rooted in the inherent uncertainty of travel times. Travel times are subject to stochastic …

We investigate traffic routing both from the perspective of real world data as well as theory.
First, we reveal through data analytics a natural but previously uncaptured regularity of real …

The price of anarchy has become a standard measure of the efficiency of equilibria in
games. Most of the literature in this area has focused on establishing worst-case bounds for …