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 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 …

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 study the inefficiency of pure Nash equilibria in symmetric network congestion games
defined over series-parallel networks with affine edge delays. For arbitrary networks, Correa …

We study time-dependent strategies for playing congestion games. The players can time
their participation in the game with the hope that fewer players will compete for the same …

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 …

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 …

In this work we study weighted network congestion games with player-specific latency
functions where selfish players wish to route their traffic through a shared network. We …

We study computational and coordination efficiency issues of Nash equilibria in symmetric
network congestion games. We first propose a simple and natural greedy method that …

We study the inefficiency of pure Nash equilibria in symmetric unweighted network
congestion games defined over series-parallel networks. We introduce a quantity y (D) to …