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

Pieter Kleer, Guido Schäfer*

*Corresponding author for this work

    Research output: Contribution to JournalArticleAcademicpeer-review

    Abstract

    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.

    Original languageEnglish
    Pages (from-to)54-89
    Number of pages36
    JournalTheory of Computing Systems
    Volume63
    Issue number1
    DOIs
    Publication statusPublished - 15 Jan 2019

    Keywords

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

    Fingerprint Dive into the research topics of 'The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games'. Together they form a unique fingerprint.

    Cite this