Theorem 2 — for every N ≥ 3, a linear congestion game with pure price of anarchy 5/2

Initializing...

Theorem 2 — for every N ≥ 3, a linear congestion game with pure price of anarchy 5/2 · Prove2Me