We study the existence of pure Nash equilibria in weighted congestion games. Let C denote a set of cost functions. We say that C is consistent if every weighted congestion game with cost functions in C possesses a pure Nash equilibrium. Our main contribution is a complete characterization of consistency of continuous cost functions. We prove that a set C of continuous functions is consistent for two-player games if and only if C contains only monotonic functions and for all nonconstant functions c1, c2 ∈ C, there are constants a, b ∈ R such that c1(x) = a c2(x) + b for all x ∈ R≥0. For games with at least three players, we prove that C is consistent if and only if exactly one of the following cases holds: (a) C contains only affine functions; (b) C contains only exponential functions such that c(x) = ac eφx + bc for some ac, bc, φ ∈ R, where ac and bc may depend on c, while φ must be equal for every c ∈ C. The latter characterization is even valid for three-player games. Finally, we derive several characterizations of consistency of cost functions for games with restricted strategy spaces, such as weighted network congestion games or weighted congestion games with singleton strategies.
['Tobias Harks', 'Max Klimm']
On the Existence of Pure Nash Equilibria in Weighted Congestion Games