Theory of Computing Systems

, Volume 63, Issue 1, pp 54–89 | Cite as

The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games

  • Pieter Kleer
  • Guido SchäferEmail author
Part of the following topical collections:
  1. Special Issue on Algorithmic Game Theory (SAGT 2016)


We introduce a unifying model to study the impact of worst-case latency deviations in non-atomic selfish routing games. In our model, latencies are subject to (bounded) deviations which are taken into account by the players. The quality deterioration caused by such deviations is assessed by the Deviation Ratio, i.e., the worst case ratio of the cost of a Nash flow with respect to deviated latencies and the cost of a Nash flow with respect to the unaltered latencies. This notion is inspired by the Price of Risk Aversion recently studied by Nikolova and Stier-Moses (Nikolova and Stier-Moses 2015). Here we generalize their model and results. In particular, we derive tight bounds on the Deviation Ratio for multi-commodity instances with a common source and arbitrary non-negative and non-decreasing latency functions. These bounds exhibit a linear dependency on the size of the network (besides other parameters). In contrast, we show that for general multi-commodity networks an exponential dependency is inevitable. We also improve recent smoothness results to bound the Price of Risk Aversion.


Selfish routing Perturbations Deviation ratio Price of risk aversion Biased price of anarchy 


  1. 1.
    Beckmann, M., McGuire, B., Winsten, C.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)Google Scholar
  2. 2.
    Bonifaci, V., Salek, M., Schäfer, G.: On the efficiency of restricted tolls in network routing games. Lecture Notes in Computer Science (2011)Google Scholar
  3. 3.
    Chen, P.-A., Kempe, D.: Altruism, selfishness, and spite in traffic routing. In: Proceedings of the 9th ACM conference on electronic commerce, pp 140–149. ACM (2008)Google Scholar
  4. 4.
    Christodoulou, G., Koutsoupias, E., Spirakis, P. G.: On the performance of approximate equilibria in congestion games. Algorithmica 61(1), 116–140 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Cominetti, R.: Equilibrium routing under uncertainty. Math. Program. 151 (1), 117–151 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: A geometric approach to the price of anarchy in nonatomic congestion games. Games and Economic Behavior 64 (2), 457–469 (2008). Special Issue in Honor of Michael B. MaschlerMathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Englert, M., Franke, T., Olbrich, L.: Sensitivity of Wardrop Equilibria, pp. 158–169. Springer, Berlin (2008)zbMATHGoogle Scholar
  8. 8.
    Fotakis, D., Kalimeris, D., Lianeas, T.: Improving selfish routing for risk-averse players. In: Proceedings of Web and Internet Economics - 11th International Conference, WINE 2015, Amsterdam, the netherlands, december 9–12, 2015, pp 328–342 (2015)Google Scholar
  9. 9.
    Hoefer, M., Olbrich, L., Skopalik, A.: Taxing subnetworks. In: Papadimitriou, C.H., Zhang, S. (eds.) WINE, volume 5385 of Lecture Notes in Computer Science, pp. 286–294. Springer (2008)Google Scholar
  10. 10.
    Kleer, P., Schäfer, G.: Path Deviations Outperform Approximate Stability in Heterogeneous Congestion Games, pp. 212–224. Springer International Publishing Cham, Berlin (2017)Google Scholar
  11. 11.
    Lianeas, T., Nikolova, E., Stier-Moses, N.E.: Asymptotically tight bounds for inefficiency in risk-averse selfish routing. CoRR, arXiv:1510.02067(2015)
  12. 12.
    Lin, H., Roughgarden, T., Tardos, É., Walkover, A.: Stronger bounds on braess’s paradox and the maximum latency of selfish routing. SIAM J. Discret. Math. 25(4), 1667–1686 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Meir, R., Parkes, D.: Playing the wrong game smoothness bounds for congestion games with behavioral biases. SIGMETRICS Perform. Eval. Rev. 43(3), 67–70 (2015)CrossRefGoogle Scholar
  14. 14.
    Meir, R., Parkes, D.C.: Congestion games with distance-based strict uncertainty. CoRR, arXiv:1411.4943 (2014)
  15. 15.
    Nikolova, E., Stier-Moses, N.E.: A mean-risk model for the traffic assignment problem with stochastic travel times. Oper. Res. 62(2), 366–382 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Nikolova, E., Stier-Moses, N.E.: The Burden of Risk Aversion in Mean-Risk Selfish Routing. In: Proceedings of the 16th ACM Conference on Economics and Computation, EC ’15, pp. 489–506. ACM, New York (2015)Google Scholar
  17. 17.
    Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)CrossRefzbMATHGoogle Scholar
  18. 18.
    Roughgarden, T.: On the severity of braess’s paradox: Designing networks for selfish users is hard. J. Comput. Syst. Sci. 72(5), 922–953 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Roughgarden, T.: Intrinsic robustness of the price of anarchy. J. ACM 62(5), 32 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Wardrop, J. G.: Some theoretical aspects of road traffic research. Proc. Inst. Civ. Eng. 1, 325–378 (1952)Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2017

Authors and Affiliations

  1. 1.Centrum Wiskunde & Informatica (CWI)Networks and Optimization GroupAmsterdamThe Netherlands
  2. 2.School of Business and EconomicsVrije Universiteit AmsterdamAmsterdamThe Netherlands

Personalised recommendations