Sciweavers

47 search results - page 1 / 10
» Nash Dynamics in Congestion Games with Similar Resources
Sort
View
WINE
2009
Springer
127views Economy» more  WINE 2009»
13 years 11 months ago
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...
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
SAGT
2009
Springer
108views Game Theory» more  SAGT 2009»
13 years 9 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
ACID
2006
298views Algorithms» more  ACID 2006»
13 years 6 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
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 ...
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
14 years 5 months ago
On the convergence of regret minimization dynamics in concave games
We study a general sub-class of concave games, which we call socially concave games. We show that if each player follows any no-external regret minimization procedure then the dyn...
Eyal Even-Dar, Yishay Mansour, Uri Nadav