Sciweavers

243 search results - page 2 / 49
» Congestion games with failures
Sort
View
IJCAI
2007
13 years 6 months ago
Multipotential Games
We introduce and analyze q-potential games and qcongestion games, where q is a positive integer. A 1-potential (congestion) game is a potential (congestion) game. We show that a g...
Dov Monderer
ESA
2010
Springer
178views Algorithms» more  ESA 2010»
13 years 6 months ago
Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
We characterize the price of anarchy in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this ...
Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden
SAGT
2009
Springer
108views Game Theory» more  SAGT 2009»
13 years 10 months ago
Nash Dynamics in Constant Player and Bounded Jump Congestion Games
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...
Tanmoy Chakraborty, Sanjeev Khanna
SAGT
2009
Springer
297views Game Theory» more  SAGT 2009»
13 years 12 months ago
Characterizing the Existence of Potential Functions in Weighted Congestion Games
Tobias Harks, Max Klimm, Rolf H. Möhring
ESA
2010
Springer
236views Algorithms» more  ESA 2010»
13 years 6 months ago
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria
Tobias Harks, Martin Hoefer, Max Klimm, Alexander ...