On the degradation of performance for traffic networks with oblivious users

We consider the problem of characterizing user equilibria and optimal solutions for routing in a given network. We extend the known models by considering users oblivious to congestion in the following sense: While in the typical user equilibrium setting the users follow a strategy that minimizes their individual cost by taking into account the (dynamic) congestion due to the current routing pattern, an oblivious user ignores congestion altogether; instead, he or she decides his routing on the basis of cheapest routes on a network without any flow whatsoever. These cheapest routes can be, for example, the shortest paths in the network without any flow. This model tries to capture the fact that a certain percentage of travelers base their route simply on the distances they observe on a map, without thinking (or knowing, or caring) about the delays experienced on this route due to their fellow travelers. In this work we study the effect of such users using as the measure of network performance its price of anarchy, i.e., the ratio of the total latency experienced by the users (oblivious or not) at equilibrium over the social optimum.

[1]  Hillel Bar-Gera,et al.  Multiclass Combined Models for Urban Travel Forecasting , 2004 .

[2]  Georgia Perakis,et al.  The "Price of Anarchy" Under Nonlinear and Asymmetric Costs , 2007, Math. Oper. Res..

[3]  P. Bovy,et al.  Quasi-variational inequality formulation of the multiclass dynamic traffic assignment problem ☆ , 2003 .

[4]  Stella Dafermos,et al.  Traffic Equilibrium and Variational Inequalities , 1980 .

[5]  Mike Smith,et al.  The existence, uniqueness and stability of traffic equilibria , 1979 .

[6]  Stella Dafermos,et al.  An Extended Traffic Assignment Model with Applications to Two-Way Traffic , 1971 .

[7]  Che-Fu Hsueh,et al.  A model and an algorithm for the dynamic user-optimal route choice problem , 1998 .

[8]  Tim Roughgarden,et al.  Stackelberg scheduling strategies , 2001, STOC '01.

[9]  S. Dafermos The Traffic Assignment Problem for Multiclass-User Transportation Networks , 1972 .

[10]  Terry L. Friesz,et al.  TRANSPORTATION NETWORK EQUILIBRIUM, DESIGN AND AGGREGATION: KEY DEVELOPMENTS AND RESEARCH OPPORTUNITIES. IN: THE AUTOMOBILE , 1985 .

[11]  Carlos F. Daganzo,et al.  TRANSPORTATION AND TRAFFIC THEORY , 1993 .

[12]  Heinz Spiess,et al.  Technical Note - Conical Volume-Delay Functions , 1990, Transp. Sci..

[13]  T. Magnanti,et al.  Equilibria on a Congested Transportation Network , 1981 .

[14]  David E. Boyce,et al.  Validation of Multiclass Urban Travel Forecasting Models Combining Origin-Destination, Mode, and Route Choices , 2003 .

[15]  David Branston,et al.  LINK CAPACITY FUNCTIONS: A REVIEW , 1976 .

[16]  David E. Boyce,et al.  Urban Transportation Network-Equilibrium and Design Models: Recent Achievements and Future Prospects , 1984 .

[17]  Tim Roughgarden,et al.  How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[18]  José R. Correa,et al.  Sloan School of Management Working Paper 4319-03 June 2003 Selfish Routing in Capacitated Networks , 2022 .

[19]  T. Koopmans,et al.  Studies in the Economics of Transportation. , 1956 .

[20]  M. L. Lahr,et al.  Regional Science Perspectives in Economic Analysis , 2001 .

[21]  George Christodoulou Price of Anarchy , 2008, Encyclopedia of Algorithms.

[22]  Tim Roughgarden,et al.  The price of anarchy is independent of the network topology , 2002, STOC '02.

[23]  Hong Kam Lo,et al.  Multiclass Dynamic Traffic Assignment Model: Formulation and Computational Experiences , 1996 .

[24]  G. Stampacchia,et al.  On some non-linear elliptic differential-functional equations , 1966 .

[25]  Stella C. Dafermos,et al.  Traffic assignment problem for a general network , 1969 .

[26]  H. Spiess CONICAL VOLUME-DELAY FUNCTIONS , 1990 .

[27]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[28]  Hai-Jun Huang,et al.  Mixed Travel Behavior in Networks with ATIS and Upper Bound of Efficiency Loss , 2007 .

[29]  Terry L. Friesz,et al.  A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem , 1993, Oper. Res..

[30]  Christos H. Papadimitriou,et al.  Worst-case Equilibria , 1999, STACS.