We present a general technique, based on a primal-dual formulation, for analyzing the
quality of self-emerging solutions in weighted congestion games. With respect to traditional …

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

This paper provides new bounds on the quality of equilibria in finite congestion games with
affine cost functions, specifically for atomic network routing games. It is well known that the …

We investigate the issues of existence and efficiency of lookahead equilibria in congestion
games. Lookahead equilibria, whose study has been initiated by Mirrokni et al.(2012) …

This paper determines the sequential price of anarchy for Rosenthal congestion games with
affine cost functions and few players. We show that for two players, the sequential price of …

One of the main results shown through Roughgarden's notions of smooth games and robust
price of anarchy is that, for any sum-bounded utilitarian social function, the worst-case price …

We introduce a novel framework to model limited lookahead in congestion games.
Intuitively, the players enter the game sequentially and choose an optimal action under the …

We continue the study of the performance of mildly greedy players in cut games initiated by
Christodoulou et al.(Theoret Comput Sci 438: 13–27, 2012), where a mildly greedy player is …

Despite the emphases on computability issues in research of algorithmic game theory, the
limited computational capacity of players have received far less attention. This work …

We consider the classical machine scheduling, where n jobs need to be scheduled on m
machines, and where job j scheduled on machine i contributes p ij∈ R to the load of …