In the future, when traffic streams comprise a mix of conventional and automated vehicles
(AVs), AVs may be employed as mobile actuators to regulate or manage traffic flow across …

This paper examines the behavior of the price of anarchy as a function of the traffic inflow in
nonatomic congestion games with multiple origin/destination (O/D) pairs. Empirical studies …

Routing games are amongst the most studied classes of games in game theory. Their most
well-known property is that learning dynamics typically converge to equilibria implying …

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 …

In the scientific literature, the ratio between the total travel cost under a user equilibrium
assignment and the total travel cost under a system optimum assignment is typically referred …

Routing games are amongst the most well studied domains of game theory. How relevant
are these pen-and-paper calculations to understanding the reality of everyday traffic …

We investigate the price of anarchy (PoA) in nonatomic congestion games when the total
demand T gets very large. First results in this direction have recently been obtained by Colini …

In this paper, we consider a mobility system of travelers and providers, and propose a"
mobility game" to study when a traveler is matched to a provider. Each traveler seeks to …

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

In this paper, we study a routing and travel-mode choice problem for mobility systems with a
multimodal transportation network as a “mobility game” with coupled action sets. We …