We study the class of congestion games for which the set of Nash equilibrium is equivalent to the set of strategy profiles played by greedy myopic players. We show these two coincide iff such games are played over extension-parallel graphs.
['Sergey Kuniavsky', 'Rann Smorodinsky']
Greediness and Equilibrium in Congestion Games