Experimental Studies of the Price of Anarchy in Non-atomic Consumption-Relevance Congestion Games
The model of non-atomic consumption-relevance congestion games (NCRCG) is an extension of the well-known non-atomic congestion games (NCG). We introduced the NCRCG model in a previous report (0814) and proved worst-case lower and upper bounds on the price of anarchy. These bounds are are tight up to a factor of gamma, where gamma is a new structural parameter of the game; we have gamma=1 for NCGs. This experimental work substantiates our conjecture that the worst-case lower bound is the best possible, i.e., that it actually also is an upper bound.