To what extent does the structure of the players' strategy space influence the efficiency of
decentralized solutions in congestion games? In this work, we investigate whether better …

​ 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 …

A matroid is a combinatorial structure that generalizes the concept of linear independence
from vector spaces to arbitrary sets [70]. Antimatroids and greedoids are well-known related …

Best response (BR) dynamics is a natural method by which players proceed toward a pure
Nash equilibrium via a local search method. The quality of the equilibrium reached may …

In load-balancing problems there is a set of clients, each wishing to select a resource from a
set of permissible ones to execute a certain task. Each resource has a latency function …

Motivated by possible applications in fault-tolerant routing, we introduce the notion of
uniform mixed equilibria in network congestion games with adversarial link failures, where …

We study the inefficiency of pure Nash equilibria in symmetric network congestion games
defined over series-parallel networks with affine edge delays. For arbitrary networks, Correa …

We study the inefficiency and computation of pure Nash equilibria in unweighted congestion
games, where the strategies of each player i are given implicitly by the binary vectors of a …

To what extent does the structure of the players' strategy space influence the efficiency of
decentralized solutions in congestion games? In this work, we investigate whether better …

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 …