WARDROP EQUILIBRIA WITH RISK-AVERSE USERS ( FORTHCOMING IN TRANSPORTATION SCIENCE )

Network games can be used to model competitive situations in which agents select routes to minimize their cost. Common applications include traffic, telecommunication and distribution networks. Although traditional network models have assumed that realized costs only depend on congestion, in most applications they also have an uncertain component. We extend Wardrop’s network game (1952) by adding random deviations, which are independent of the flow, to the cost functions that model congestion in each arc. We map these uncertainties into a Wardrop equilibrium model with nonadditive path costs. The cost on a path is given by the sum of the congestion on its arcs plus a constant safety margin determined by risk-averse agents. First, we prove that an equilibrium for this game always exists and is essentially unique. Then, we introduce three specific equilibrium models that fall within this framework: the percentile equilibrium where agents select paths that minimize a specified percentile of the uncertain cost; the added-variability equilibrium where agents add a multiple of the variability of the cost of each arc to the expected cost; and the robust equilibrium where agents select paths by solving a robust optimization problem that imposes a limit on the number of arcs that can deviate from the mean. The percentile equilibrium is difficult to compute because minimizing a percentile among all paths is computationally hard. Instead, the added-variability and robust Wardrop equilibria can be computed efficiently in practice: the former reduces to a standard Wardrop equilibrium problem and the latter is found using a column generation approach that repeatedly solves robust shortest path problems, which are polynomially solvable. Through computational experiments of some random and some realistic instances, we explore the benefits and trade-offs of the proposed solution concepts. We show that when agents are risk averse, both the robust and added-variability equilibria better approximate percentile equilibria than the classic Wardrop equilibrium.

[1]  Michael C. Ferris,et al.  Complementarity: Applications, Algorithms and Extensions , 2010 .

[2]  Satish V. Ukkusuri,et al.  Approximate analytical expressions for transportation network performance under demand uncertainty , 2010 .

[3]  Y. Nie,et al.  Shortest path problem considering on-time arrival probability , 2009 .

[4]  Patrice Marcotte,et al.  Existence and computation of optimal tolls in multiclass network equilibrium problems , 2009, Oper. Res. Lett..

[5]  Fernando Ordóñez,et al.  Robust capacity expansion of network flows , 2007, Networks.

[6]  Alper Atamtürk,et al.  Two-Stage Robust Network Flow and Design Under Demand Uncertainty , 2007, Oper. Res..

[7]  Fernando Ordóñez,et al.  Robust Wardrop Equilibrium , 2007, NET-COOP.

[8]  Dimitris Bertsimas,et al.  Robust game theory , 2006, Math. Program..

[9]  David R. Karger,et al.  Optimal Route Planning under Uncertainty , 2006, ICAPS.

[10]  Itai Ashlagi,et al.  Resource selection games with unknown number of players , 2006, AAMAS '06.

[11]  Eitan Altman,et al.  A survey on networking games in telecommunications , 2006, Comput. Oper. Res..

[12]  Dimitris Bertsimas,et al.  A Robust Optimization Approach to Inventory Theory , 2006, Oper. Res..

[13]  R. Kalaba,et al.  Arriving on Time , 2005 .

[14]  Rolf H. Möhring,et al.  System-optimal Routing of Traffic Flows with User Constraints in Networks with Congestion System-optimal Routing of Traffic Flows with User Constraints in Networks with Congestion , 2022 .

[15]  André de Palma,et al.  Route choice decision under travel time uncertainty , 2005 .

[16]  Yueyue Fan,et al.  Shortest paths in stochastic networks with correlated link costs , 2005 .

[17]  John C. Harsanyi,et al.  Games with Incomplete Information Played by "Bayesian" Players, I-III: Part I. The Basic Model& , 2004, Manag. Sci..

[18]  Mohammad Mahdian,et al.  Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[19]  Dimitris Bertsimas,et al.  A Robust Optimization Approach to Supply Chain Management , 2004, IPCO.

[20]  Hai Yang,et al.  The multi-class, multi-criteria traffic network equilibrium and systems optimum problem , 2004 .

[21]  Laurent El Ghaoui,et al.  Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach , 2003, Oper. Res..

[22]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

[23]  Hong Kam Lo,et al.  Network with degradable links: capacity analysis and design , 2003 .

[24]  Donald Goldfarb,et al.  Robust Portfolio Selection Problems , 2003, Math. Oper. Res..

[25]  Boaz Golany,et al.  Supplier-Retailer Flexible Commitments Contracts : A Robust Optimization Approach , 2003 .

[26]  Michael G.H. Bell,et al.  Risk-averse user equilibrium traffic assignment: an application of game theory , 2002 .

[27]  Tim Roughgarden,et al.  How unfair is optimal routing? , 2002, SODA '02.

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

[29]  R. Vanderbei LOQO:an interior point code for quadratic programming , 1999 .

[30]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..

[31]  A. Palma,et al.  Optimization formulations and static equilibrium in congested transportation networks , 1998 .

[32]  Laurent El Ghaoui,et al.  Robust Solutions to Uncertain Semidefinite Programs , 1998, SIAM J. Optim..

[33]  Robert B. Noland,et al.  Simulating Travel Reliability , 1997 .

[34]  Arkadi Nemirovski,et al.  Robust Truss Topology Design via Semidefinite Programming , 1997, SIAM J. Optim..

[35]  David Bernstein,et al.  The Traffic Equilibrium Problem with Nonadditive Path Costs , 1995, Transp. Sci..

[36]  D. Hearn,et al.  Congestion Toll Pricing of Traffic Networks , 1997 .

[37]  L El Ghaoui,et al.  ROBUST SOLUTIONS TO LEAST-SQUARE PROBLEMS TO UNCERTAIN DATA MATRICES , 1997 .

[38]  Yasunori Iida,et al.  RISK ASSIGNMENT: A NEW TRAFFIC ASSIGNMENT MODEL CONSIDERING THE RISK OF TRAVEL TIME VARIATION. , 1993 .

[39]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[40]  A. Nagurney Network Economics: A Variational Inequality Approach , 1992 .

[41]  John N. Tsitsiklis,et al.  An Analysis of Stochastic Shortest Path Problems , 1991, Math. Oper. Res..

[42]  Giovanni Andreatta,et al.  Stochastic shortest paths with recourse , 1988, Networks.

[43]  Pitu Mirchandani,et al.  Generalized Traffic Equilibrium with Probabilistic Travel Times and Perceptions , 1987, Transp. Sci..

[44]  R. Myerson,et al.  Efficient and Durable Decision Rules with Incomplete Information , 1983 .

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

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

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

[48]  Carlos F. Daganzo,et al.  On Stochastic Models of Traffic Assignment , 1977 .

[49]  Dietrich Braess,et al.  Über ein Paradoxon aus der Verkehrsplanung , 1968, Unternehmensforschung.

[50]  J. Harsanyi Games with Incomplete Information Played by “Bayesian” Players Part II. Bayesian Equilibrium Points , 1968 .

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

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