We extend the study of the complexity of computing an
-approximate Nash equilibrium in symmetric congestion games from the case of positive delay functions to delays of arbitrary sign. Our results show that with this extension the complexity has a richer structure, and it depends on the exact nature of the signs allowed. We first prove that in symmetric games with increasing delay functions and with
-bounded jump the
-Nash dynamic converges in polynomial time when all delays are negative, similarly to the case of positive delays. We are able to extend this result to monotone delay functions. We then establish a hardness result for symmetric games with increasing delay functions and with
-bounded jump when the delays can be both positive and negative: in that case computing an
-approximate Nash equilibrium becomes
-complete, even if each delay function is of constant sign or of constant absolute value.