… For the price of stability of atomic congestion games we give non-tight bounds for linear
latencies. Our results not only encompass and generalize the existing results of exact equilibria …

… We consider non-atomic network congestion games with … Nash flows coincide with approximate
Nash flows and derive tight … of both deviated and approximate Nash flows for arbitrary …

… approximate pure Nash equilibrium with PoS at most (d+3)/2; the equilibrium's approximation
… Second, we show that for unweighted congestion games, the PoS of α-approximate Nash …

… games to rapidly reach an approximate (pure) Nash equilibrium. Our main result states that
for symmetric congestion games in … this question in the general arena of congestion games. A …

… models to approximate the equilibria in the finite games. Finally, … of anarchy (PoA) and the
price of stability (PoS)—as measures of … congestion games and Bernoulli congestion games. …

… More specifically, we are interested in the pure Nash equilibria (PNE) of those games;
these are stable configurations from which no player would benefit from unilaterally deviating. …

We present a deterministic polynomial-time algorithm for computing d d + o ( d ) -approximate
(pure) Nash equilibria in (proportional sharing) weighted congestion games with …

… of stability (PoS), which is an equally interesting concept, is much less understood. In this
article, we consider congestion games … The lower bound is still valid, as we can approximate an …

… of the equilibria that are most stable in the presence of noise. In … games: atomic congestion
games and selfish load balancing. The noisy best-response dynamics in these games keeps …

… congestion games with polynomial latency functions of maximum degree d ≥ 1 . For these
games, … α-approximate price of stability of the game as PoS α = min e ∈ E α ⁡ C ( e ) C ( o ) . …