Pure Nash equilibria in player-specific and weighted congestion games
Unlike standard congestion games, weighted congestion games and congestion games with
player-specific delay functions do not necessarily possess pure Nash equilibria. It is known …
player-specific delay functions do not necessarily possess pure Nash equilibria. It is known …
Pure Nash equilibria in player-specific and weighted congestion games
Unlike standard congestion games, weighted congestion games and congestion games with
player-specific delay functions do not necessarily possess pure Nash equilibria. It is known …
player-specific delay functions do not necessarily possess pure Nash equilibria. It is known …
Complexity of pure Nash equilibria in player-specific network congestion games
H Ackermann, A Skopalik - Internet Mathematics, 2008 - Taylor & Francis
Network congestion games with player-specific delay functions do not possess pure Nash
equilibria in general. We therefore address the computational complexity of the …
equilibria in general. We therefore address the computational complexity of the …
Nash dynamics in congestion games with similar resources
We study convergence of ε-Nash dynamics in congestion games when delay functions of all
resources are similar. Delay functions are said to be similar if their values are within a …
resources are similar. Delay functions are said to be similar if their values are within a …
On the complexity of pure Nash equilibria in player-specific network congestion games
H Ackermann, A Skopalik - International Workshop on Web and Internet …, 2007 - Springer
Network congestion games with player-specific delay functions do not necessarily possess
pure Nash equilibria. We therefore address the computational complexity of the …
pure Nash equilibria. We therefore address the computational complexity of the …
Strong and correlated strong equilibria in monotone congestion games
O Rozenfeld, M Tennenholtz - … , WINE 2006, Patras, Greece, December 15 …, 2006 - Springer
The study of congestion games is central to the interplay between computer science and
game theory. However, most work in this context does not deal with possible deviations by …
game theory. However, most work in this context does not deal with possible deviations by …
Improving approximate pure nash equilibria in congestion games
V Ravindran Vijayalakshmi, A Skopalik - International Conference on Web …, 2020 - Springer
Congestion games constitute an important class of games to model resource allocation by
different users. As computing an exact 18 or even an approximate 34 pure Nash equilibrium …
different users. As computing an exact 18 or even an approximate 34 pure Nash equilibrium …
The complexity of equilibria in cost sharing games
V Syrgkanis - Internet and Network Economics: 6th International …, 2010 - Springer
Abstract We study Congestion Games with non-increasing cost functions (Cost Sharing
Games) from a complexity perspective and resolve their computational hardness, which has …
Games) from a complexity perspective and resolve their computational hardness, which has …
Congestion games with player-specific costs revisited
We study the existence of pure Nash equilibria in congestion games with player-specific
costs. Specifically, we provide a thorough characterization of the maximal sets of cost …
costs. Specifically, we provide a thorough characterization of the maximal sets of cost …
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games: –Extended Abstract–
J Dunkel, AS Schulz - International Workshop on Internet and Network …, 2006 - Springer
Congestion games are a fundamental class of noncooperative games possessing pure-
strategy Nash equilibria. In the network version, each player wants to route one unit of flow …
strategy Nash equilibria. In the network version, each player wants to route one unit of flow …