We show exact values for the worst-case price of anarchy in weighted and unweighted (atomic unsplittable) congestion games, provided that all cost functions are bounded-degree polynomials with nonnegative coefficients. The given values also hold for weighted and unweighted network congestion games.
Aland et al. REF gave exact bounds for weighted and unweighted congestion games.
Exact price of anarchy for polynomial congestion games
Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS’06), volume 3884 of LNCS
Computer Science Mathematics