Our main interest game-theoretic object in this paper is the class of (explicit) congestion games with a polynomial number of facilities and actions for each player.
We show that, in terms of complexity of finding a Nash equilibrium, this class is equivalent to \(c\) -polytensor identical interest games (a generalization of polymatrix identical interest gamesAlso called network coordination games in [1]}.).
We now formally introduce each of this classes.
