Motivated by possible applications in fault-tolerant routing, we introduce the notion of
uniform mixed equilibria in network congestion games with adversarial link failures, where …

Motivated by possible applications in fault-tolerant selfish routing, we introduce the notion of
uniform mixed equilibrium in network congestion games with adversarial link failures, where …

We investigate the effect of linear independence in the strategies of congestion games on
the convergence time of best improvement sequences and on the pure Price of Anarchy. In …

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 …

We study the inefficiency of pure Nash equilibria in symmetric unweighted network
congestion games. We first explore the impact of symmetry on the worst-case PoA of …

We introduce (super) polynomial bottleneck games, where the utility costs of the players are
(super) polynomial functions of the congestion of the resources that they use, and the social …

Hayrapetyan, Tardos and Wexler recently introduced a framework to study the impact of
collusion in congestion games on the quality of Nash equilibria. We adopt their framework to …

We investigate the effect of linear independence in the strategies of congestion games on
the convergence time of best response dynamics and on the pure Price of Anarchy. In …

Network congestion games with player-specific delay functions do not possess pure Nash
equilibria in general. We therefore address the computational complexity of the …

This paper provides new bounds on the quality of equilibria in finite congestion games with
affine cost functions, specifically for atomic network routing games. It is well known that the …