This paper provides a simple formula describing all Nash equilibria in symmetric monotone singleton congestion games. Our approach also yields a new and short proof establishing the existence of a Nash equilibrium in this kind of congestion games without invoking the potential function or the...

In this note we study the existence of Nash equilibria in nonsymmetric finite congestion games, complementing the results obtained by Milchtaich on monotone-decreasing congestion games. More specifically, we examine the case of two resources and we propose a simple method describing all Nash...

We define a new class of games, which we qualify as congestion games with exact partition. These games constitute a subfamily of singleton congestion games for which the players are restricted to choose only one strategy, but they each possess their own utility function. The aim of this paper is...

This paper provides a simple formula describing all Nash equilibria in monotone symmetric singleton congestion games. Our approach also yields a new and short proof establishing the existence of a Nash equilibrium in this kind of congestion games.