EXACT PRICE OF ANARCHY FOR POLYNOMIAL CONGESTION GAMES Artikel uri icon

Open Access

  • true

Peer Reviewed

  • true

Abstract

  • 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.

Veröffentlichungszeitpunkt

  • Januar 1, 2011