Path deviations outperform approximate stability in heterogeneous congestion games

DOI10.1007/978-3-319-66700-3_17zbMATH Open1403.91070arXiv1707.01278OpenAlexW2727093586MaRDI QIDQ681874FDOQ681874

Authors: Pieter Kleer, Guido Schäfer 

Publication date: 13 February 2018

Abstract: We consider non-atomic network congestion games with heterogeneous players where the latencies of the paths are subject to some bounded deviations. This model encompasses several well-studied extensions of the classical Wardrop model which incorporate, for example, risk-aversion, altruism or travel time delays. Our main goal is to analyze the worst-case deterioration in social cost of a perturbed Nash flow (i.e., for the perturbed latencies) with respect to an original Nash flow. We show that for homogeneous players perturbed Nash flows coincide with approximate Nash flows and derive tight bounds on their inefficiency. In contrast, we show that for heterogeneous populations this equivalence does not hold. We derive tight bounds on the inefficiency of both perturbed and approximate Nash flows for arbitrary player sensitivity distributions. Intuitively, our results suggest that the negative impact of path deviations (e.g., caused by risk-averse behavior or latency perturbations) is less severe than approximate stability (e.g., caused by limited responsiveness or bounded rationality). We also obtain a tight bound on the inefficiency of perturbed Nash flows for matroid congestion games and homogeneous populations if the path deviations can be decomposed into edge deviations. In particular, this provides a tight bound on the Price of Risk-Aversion for matroid congestion games.

Full work available at URL: https://arxiv.org/abs/1707.01278

Recommendations

• The impact of worst-case deviations in non-atomic network routing games
• The impact of worst-case deviations in non-atomic network routing games
• Stochastic congestion games with risk-averse players
• On the performance of approximate equilibria in congestion games
• On the Performance of Approximate Equilibria in Congestion Games

zbMATH Keywords

Nash flowsheterogeneous congestion gamesmatroid congestion games

Mathematics Subject Classification ID

Games with infinitely many players (91A07) Games involving graphs (91A43)

Cited In (7)

• The impact of worst-case deviations in non-atomic network routing games
• The impact of worst-case deviations in non-atomic network routing games
• Robust networked multiagent optimization: designing agents to repair their own utility functions
• Price of anarchy for parallel link networks with generalized mean objective
• Stochastic congestion games with risk-averse players
• Tight inefficiency bounds for perception-parameterized affine congestion games
• Heterogeneity and chaos in congestion games

This page was built for publication: Path deviations outperform approximate stability in heterogeneous congestion games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q681874)