In this work, we study the combinatorial structure and the computational complexity of Nash
equilibria for a certain game that models selfish routing over a network consisting of m …

We show exact values for the worst-case price of anarchy in weighted and unweighted
(atomic unsplittable) congestion games, provided that all cost functions are bounded-degree …

We consider the efficiency of taxation in congestion games with polynomial latency functions
along the line of research initiated by Caragiannis et al.[ACM Transactions on Algorithms …

LNCS 3884 - Exact Price of Anarchy for Polynomial Congestion Games Page 1 Exact Price of
Anarchy for Polynomial Congestion Games * Sebastian Aland, Dominic Dumrauf, Martin …

In this work, we study the combinatorial structure and the computational complexity of Nash
equilibria for a certain game that models selfish routing over a network consisting of m …

In large-scale or evolving networks, such as the Internet, there is no authority possible to
enforce a centralized traffic management. In such situations, game theory, and especially the …

Congestion games are a fundamental and widely studied model for selfish allocation
problems like routing and load balancing. An intrinsic property of these games is that players …

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 …

In mobile network, it is likely that many mobile nodes handover at the same time, which is
defined as group handover. The problem of network selection arises for group handover …