We consider algorithmic questions concerning the existence, tractability, and quality of Nash
equilibria, in atomic congestion games among users participating in selfish coalitions. We …

We consider algorithmic questions concerning the existence, tractability and quality of
atomic congestion games, among users that are considered to participate in (static) selfish …

We investigate the effectiveness of Stackelberg strategies for atomic congestion games with
unsplittable demands. In our setting, only a fraction of the players are selfish, while the rest …

We consider the price of anarchy of pure Nash equilibria in congestion games with linear
latency functions. For asymmetric games, the price of anarchy of maximum social cost is Θ …

We study computational and coordination efficiency issues of Nash equilibria in symmetric
network congestion games. We first propose a simple and natural greedy method that …

Bottleneck congestion games properly model the properties of many real-world network
routing applications. They are known to possess strong equilibria–a strengthening of Nash …

Affine congestion games are a well-studied model for selfish behavior in distributed systems,
such as transportation and communication networks. Seminal influential papers in …

We consider the atomic version of congestion games with affine cost functions, and analyze
the quality of worst case Nash equilibria when the strategy spaces of the players are the set …

We study the performance of approximate Nash equilibria for congestion games with
polynomial latency functions. We consider how much the price of anarchy worsens and how …

In this survey we present some recent advances in the literature of atomic (mainly network)
congestion games. The algorithmic questions that we are interested in have to do with the …