​ 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 introduce an online learning algorithm in the bandit feedback model that, once adopted
by all agents of a congestion game, results in game-dynamics that converge to an $\epsilon …

We consider weighted congestion games with polynomial latency functions of maximum
degree d≥ 1. For these games, we investigate the existence and efficiency of approximate …

We study the existence of approximate pure Nash equilibria (α-PNE) in weighted atomic
congestion games with polynomial cost functions of maximum degree d. Previously, it was …

Cut games are among the most fundamental strategic games in algorithmic game theory. It
is well-known that computing an exact pure Nash equilibrium in these games is PLS-hard …

We present a fully polynomial-time approximation scheme (FPTAS) for computing equilibria
in congestion games, under\emph {smoothed} running-time analysis. More precisely, we …

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 …

In this work, we seek a more refined understanding of the complexity of local optimum
computation for Max-Cut and pure Nash equilibrium (PNE) computation for congestion …

This paper concerns computing approximate pure Nash equilibria in weighted congestion
games, which has been shown to be PLS-complete. With the help of $\hat {\Psi} $-game and …

We study the existence, computation, and quality of (approximate) pure Nash equilibria in
atomic (network) congestion games with increasing and decreasing resource cost functions …