Exact price of anarchy for polynomial congestion games
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 …
(atomic unsplittable) congestion games, provided that all cost functions are bounded-degree …
On the existence of pure Nash equilibria in weighted congestion games
We study the existence of pure Nash equilibria in weighted congestion games. Let 𝒞 denote
a set of cost functions. We say that 𝒞 is consistent if every weighted congestion game with …
a set of cost functions. We say that 𝒞 is consistent if every weighted congestion game with …
Weighted congestion games: the price of anarchy, universal worst-case examples, and tightness
We characterize the Price of Anarchy (POA) in weighted congestion games, as a function of
the allowable resource cost functions. Our results provide as thorough an understanding of …
the allowable resource cost functions. Our results provide as thorough an understanding of …
Exact price of anarchy for polynomial congestion games
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 …
Anarchy for Polynomial Congestion Games * Sebastian Aland, Dominic Dumrauf, Martin …
Characterizing the existence of potential functions in weighted congestion games
Since the pioneering paper of Rosenthal a lot of work has been done in order to determine
classes of games that admit a potential. First, we study the existence of potential functions for …
classes of games that admit a potential. First, we study the existence of potential functions for …
Approximate pure Nash equilibria in weighted congestion games: existence, efficient computation, and structure
We consider structural and algorithmic questions related to the Nash dynamics of weighted
congestion games. In weighted congestion games with linear latency functions, the …
congestion games. In weighted congestion games with linear latency functions, the …
User-centric radio access technology selection: A survey of game theory models and multi-agent learning algorithms
User-centric radio access technology (RAT) selection is a key communication paradigm,
given the increased number of available RATs and increased cognitive capabilities at the …
given the increased number of available RATs and increased cognitive capabilities at the …
On approximate pure Nash equilibria in weighted congestion games with polynomial latencies
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 …
degree d≥ 1. For these games, we investigate the existence and efficiency of approximate …
A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
V Bilo - International Workshop on Approximation and Online …, 2012 - Springer
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 …
quality of self-emerging solutions in weighted congestion games. With respect to traditional …
Restoring pure equilibria to weighted congestion games
Congestion games model several interesting applications, including routing and network
formation games, and also possess attractive theoretical properties, including the existence …
formation games, and also possess attractive theoretical properties, including the existence …