<div><p>Large-scale daily commuting data were combined with detailed geographical information system (GIS) data to analyze the loss of transport efficiency caused by drivers’ uncoordinated routing in urban road networks. We used Price of Anarchy (POA) to quantify the loss of transport efficiency and found that both volume and distribution of human mobility demand determine the POA. In order to reduce POA, a small number of highways require considerable decreases in traffic, and their neighboring arterial roads need to attract more traffic. The magnitude of the adjustment in traffic flow can be estimated using the fundamental measure traffic flow only, which is widely available and easy to collect. Surprisingly, the most congested roads or t...
We study the influence of information design on routing in the presence of vagaries, following the c...
This paper examines the behavior of the price of anarchy as a function of the traffic inflow in nona...
We consider the problem of characterizing user equilibria and optimal solutions for routing in a giv...
Large-scale daily commuting data were combined with detailed geographical information system (GIS) d...
Large-scale daily commuting data were combined with detailed geographical information system (GIS) d...
An economy in which individual agents each choose their optimum strategy does not necessarily optimi...
The efficiency of routing traffic through a network, comprising nodes connected by links whose cost ...
Selfish routing, represented by the User-Equilibrium (UE) model, is known to be inefficient when com...
We investigate traffic routing both from the perspective of real world data as well as theory. First...
Theoretical upper bounds for price of anarchy have been calculated in previous studies. We present a...
This dissertation furthers the understanding of macroscopic traffic behavior on urban networks. In p...
International audienceThis paper examines the behavior of the price of anarchy as a function of the ...
We study the effect of perturbations on the Price of Anarchy for the Traffic Assignment Problem. Ado...
In earlier work (Zhang et al., 2016) we used actual traffic data from the Eastern Massachusetts tran...
We study the influence of information design on routing in the presence of vagaries, following the c...
This paper examines the behavior of the price of anarchy as a function of the traffic inflow in nona...
We consider the problem of characterizing user equilibria and optimal solutions for routing in a giv...
Large-scale daily commuting data were combined with detailed geographical information system (GIS) d...
Large-scale daily commuting data were combined with detailed geographical information system (GIS) d...
An economy in which individual agents each choose their optimum strategy does not necessarily optimi...
The efficiency of routing traffic through a network, comprising nodes connected by links whose cost ...
Selfish routing, represented by the User-Equilibrium (UE) model, is known to be inefficient when com...
We investigate traffic routing both from the perspective of real world data as well as theory. First...
Theoretical upper bounds for price of anarchy have been calculated in previous studies. We present a...
This dissertation furthers the understanding of macroscopic traffic behavior on urban networks. In p...
International audienceThis paper examines the behavior of the price of anarchy as a function of the ...
We study the effect of perturbations on the Price of Anarchy for the Traffic Assignment Problem. Ado...
In earlier work (Zhang et al., 2016) we used actual traffic data from the Eastern Massachusetts tran...
We study the influence of information design on routing in the presence of vagaries, following the c...
This paper examines the behavior of the price of anarchy as a function of the traffic inflow in nona...
We consider the problem of characterizing user equilibria and optimal solutions for routing in a giv...