On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games
Vittorio Bil\`o

TL;DR
This paper extends the understanding of the robustness of the price of anarchy in generalized congestion games, showing that for a broader class of social functions and latency conditions, the worst-case inefficiency remains consistent across approximate equilibria.
Contribution
It proves that the worst-case price of anarchy for approximate equilibria matches that of pure equilibria in more general congestion game settings, beyond previous smoothness-based results.
Findings
Worst-case price of anarchy matches for approximate and pure equilibria.
Results apply to broader classes of social functions and latency functions.
Primal-dual method can determine the price of anarchy in these settings.
Abstract
One of the main results shown through Roughgarden's notions of smooth games and robust price of anarchy is that, for any sum-bounded utilitarian social function, the worst-case price of anarchy of coarse correlated equilibria coincides with that of pure Nash equilibria in the class of weighted congestion games with non-negative and non-decreasing latency functions and that such a value can always be derived through the, so called, smoothness argument. We significantly extend this result by proving that, for a variety of (even non-sum-bounded) utilitarian and egalitarian social functions and for a broad generalization of the class of weighted congestion games with non-negative (and possibly decreasing) latency functions, the worst-case price of anarchy of -approximate coarse correlated equilibria still coincides with that of -approximate pure Nash equilibria, for any…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
