We study the impact of combinatorial structure in congestion games on the complexity of
computing pure Nash equilibria and the convergence time of best response sequences. In …

We study the problem of minimizing the maximum latency of flows in networks with
congestion. We show that this problem is NP-hard, even when all arc latency functions are …

In this paper, we introduce and analyze the properties of a class of games, the atomic
congestion games on graphs (ACGGs), which is a generalization of the classical congestion …

We consider the problem of minimizing social cost in atomic congestion games and show,
perhaps surprisingly, that efficiently computed taxation mechanisms yield the same …

Joint use of resources with usage-dependent cost raises the question: who pays how much?
We study cost sharing in resource selection games where the strategy spaces are either …

This paper explains when and how communication and computational lower bounds for
algorithms for an optimization problem translate to lower bounds on the worst-case quality of …

We give several new upper and lower bounds on the worst-case severity of Braess's
paradox and the price of anarchy of selfish routing with respect to the maximum latency …

​ Congestion games are a fundamental class of games widely considered and studied in
non-cooperative game theory, introduced to model several realistic scenarios in which …

We investigate issues of complexity related to welfare maximization in congestion games. In
particular, we provide a full classification of complexity results for the problem of finding a …

Worst-case hardness results for most equilibrium computation problems have raised the
need for beyond-worst-case analysis. To this end, we study the smoothed complexity of …