Uncertainty in Multicommodity Routing Networks: When Does It Help?

We study the equilibrium behavior in a multicommodity selfish routing game with uncertain users, where each user over- or underestimates their congestion costs by a multiplicative factor. Surprisingly, we find that uncertainties in different directions have qualitatively distinct impacts on equilibria. Namely, contrary to the usual notion that uncertainty increases inefficiencies, network congestion decreases when users overestimate their costs. On the other hand, underestimation of costs leads to increased congestion. We apply these results to urban transportation networks, where drivers have different estimates about the cost of congestion. In light of the dynamic pricing policies aimed at tackling congestion, our results indicate that users' perception of these prices can significantly impact the policy's efficacy, and “caution in the face of uncertainty” leads to favorable network conditions.

[1]  Igal Milchtaich,et al.  Network Topology and the Efficiency of Equilibrium , 2005, Games Econ. Behav..

[2]  Dimitris Fotakis,et al.  Improving Selfish Routing for Risk-Averse Players , 2015, Theory of Computing Systems.

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

[4]  S. Shankar Sastry,et al.  Understanding the impact of parking on urban mobility via routing games on queue-flow networks , 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).

[5]  Pravin Varaiya,et al.  Travel-Time Reliability as a Measure of Service , 2003 .

[6]  Eitan Altman,et al.  Constrained traffic equilibrium in routing , 2003, IEEE Trans. Autom. Control..

[7]  Alexandre M. Bayen,et al.  A heterogeneous routing game , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[8]  Hamidreza Tavafoghi,et al.  Informational incentives for congestion games , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[9]  Shanjiang Zhu,et al.  Do People Use the Shortest Path? An Empirical Test of Wardrop’s First Principle , 2015, PloS one.

[10]  Alexandre M. Bayen,et al.  Negative externalities of GPS-enabled routing applications: A game theoretical approach , 2016, 2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC).

[11]  B. Schaller New York City's Congestion Pricing Experience and Implications for Road Pricing Acceptance in the United States , 2010 .

[12]  David C. Parkes,et al.  Playing the Wrong Game: Smoothness Bounds for Congestion Games with Behavioral Biases , 2014, PERV.

[13]  Umang Bhaskar,et al.  Routing games , 2012 .

[14]  Martin Gairing,et al.  Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions , 2006, ICALP.

[15]  Marios Mavronicolas,et al.  Congestion Games with Player-Specific Constants , 2007, MFCS.

[16]  Martin Gairing,et al.  Selfish Routing with Incomplete Information , 2005, SPAA '05.

[17]  Shaler Stidham,et al.  Pricing and congestion management in a network with heterogeneous users , 2004, IEEE Transactions on Automatic Control.

[18]  N. Stier-Moses,et al.  Wardrop Equilibria with Risk-Averse Users , 2010 .

[19]  Cedric Langbort,et al.  On informational nudging and control of payoff-based learning , 2013 .

[20]  J. Prashker,et al.  Violations of Expected Utility Theory in Route-Choice Stated Preferences: Certainty Effect and Inflation of Small Probabilities , 2004 .

[21]  I. Milchtaich,et al.  Congestion Games with Player-Specific Payoff Functions , 1996 .

[22]  A. Walters The Theory and Measurement of Private and Social Cost of Highway Congestion , 1961 .

[23]  Jean C. Walrand,et al.  Sharing Network Resources , 2014, Sharing Network Resources.

[24]  D. Schrank,et al.  2015 Urban Mobility Scorecard , 2015 .

[25]  Lillian J. Ratliff,et al.  Uncertainty in Multi-Commodity Routing Networks: When does it help? , 2017, 2018 Annual American Control Conference (ACC).

[26]  Eitan Altman,et al.  Nash equilibria for combined flow control and routing in networks: asymptotic behavior for a large number of users , 2002, IEEE Trans. Autom. Control..

[27]  Tim Roughgarden,et al.  The price of anarchy in games of incomplete information , 2012, SECO.

[28]  Philip N. Brown,et al.  Fundamental limits of locally-computed incentives in network routing , 2017, 2017 American Control Conference (ACC).

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

[30]  G. DeFriese,et al.  The New York Times , 2020, Publishing for Libraries.

[31]  Alexandre M. Bayen,et al.  Online Learning of Nash Equilibria in Congestion Games , 2015, SIAM J. Control. Optim..

[32]  Defeng Sun,et al.  Preferences for travel time under risk and ambiguity: Implications in path selection and network equilibrium , 2016 .

[33]  A. Tversky,et al.  Judgment under Uncertainty: Heuristics and Biases , 1974, Science.

[34]  Massimo Warglien,et al.  Playing the Wrong Game: An Experimental Analysis of Relational Complexity and Strategic Misrepresentation , 2008, Games Econ. Behav..

[35]  Max Klimm,et al.  Demand-Independent Optimal Tolls , 2017, ICALP.

[36]  Saurabh Amin,et al.  Informational aspects in a class of Bayesian congestion games , 2017, 2017 American Control Conference (ACC).

[37]  L. Shapley,et al.  Potential Games , 1994 .

[38]  W. Vickrey PRICING IN URBAN AND SUBURBAN TRANSPORT , 1994 .

[39]  Johanne Cohen,et al.  Learning with Bandit Feedback in Potential Games , 2017, NIPS.

[40]  Eitan Altman,et al.  Competitive routing in networks with polynomial costs , 2002, IEEE Trans. Autom. Control..

[41]  Asuman E. Ozdaglar,et al.  Informational Braess' Paradox: The Effect of Information on Traffic Congestion , 2016, Oper. Res..

[42]  David C. Parkes,et al.  Congestion Games with Distance-Based Strict Uncertainty , 2014, AAAI.

[43]  Evdokia Nikolova,et al.  The Burden of Risk Aversion in Mean-Risk Selfish Routing , 2014, EC.

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

[45]  Luc Vandendorpe,et al.  Power Control in Networks With Heterogeneous Users: A Quasi-Variational Inequality Approach , 2015, IEEE Transactions on Signal Processing.

[46]  Tian Qi,et al.  Control Under Stochastic Multiplicative Uncertainties: Part I, Fundamental Conditions of Stabilizability , 2017, IEEE Transactions on Automatic Control.

[47]  Erik Butler,et al.  Felt Time: The Psychology of How We Perceive Time , 2016 .

[48]  Richard Cole,et al.  When Does Diversity of User Preferences Improve Outcomes in Selfish Routing? , 2017, IJCAI.

[49]  Lillian J. Ratliff,et al.  To observe or not to observe: Queuing game framework for urban parking , 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).

[50]  Gerd Gigerenzer,et al.  Fast and frugal heuristics: The tools of bounded rationality , 2004 .

[51]  D. Shoup,et al.  Getting the Prices Right , 2013 .

[52]  Po-An Chen,et al.  Altruism and Its Impact on the Price of Anarchy , 2014, TEAC.

[53]  Amnon Rapoport,et al.  Decision Making under Strict Uncertainty: An Experimental Test of Competitive Criteria , 1995 .

[54]  Zhen Sun,et al.  Travel Times on Changeable Message Signs Volume II – Evaluation of Transit Signs , 2009 .

[55]  Michael Ostrovsky,et al.  Carpooling and the Economics of Self-Driving Cars , 2018, EC.

[56]  Xinkai Wu,et al.  Perception of Waiting Time at Signalized Intersections , 2009 .

[57]  Philip N. Brown,et al.  The Robustness of Marginal-Cost Taxes in Affine Congestion Games , 2017, IEEE Transactions on Automatic Control.

[58]  Fernando Ordóñez,et al.  Wardrop Equilibria with Risk-Averse Users , 2010, Transp. Sci..

[59]  Alexandre M. Bayen,et al.  Stackelberg Routing on Parallel Networks With Horizontal Queues , 2012, IEEE Transactions on Automatic Control.