Path deviations outperform approximate stability in heterogeneous congestion games

DOI10.1007/978-3-319-66700-3_17zbMath1403.91070arXiv1707.01278OpenAlexW2727093586MaRDI QIDQ681874

Pieter Kleer, Guido Schäfer

Publication date: 13 February 2018

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

zbMATH Keywords

Nash flowsheterogeneous congestion gamesmatroid congestion games

Mathematics Subject Classification ID

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

Related Items (4)

Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games ⋮ Price of anarchy for parallel link networks with generalized mean objective ⋮ Robust networked multiagent optimization: designing agents to repair their own utility functions ⋮ The impact of worst-case deviations in non-atomic network routing games

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