Sciweavers

91 search results - page 1 / 19
» Equilibrium Results for Dynamic Congestion Games
Sort
View
TRANSCI
2010
104views more  TRANSCI 2010»
12 years 11 months ago
Equilibrium Results for Dynamic Congestion Games
Consider the following game. Given a network with a continuum of users at some origins, suppose that users wish to reach specic destinations, but that they are not indierent to the...
Frédéric Meunier, Nicolas Wagner
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
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
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
PODC
2009
ACM
14 years 4 months ago
Concurrent imitation dynamics in congestion games
Imitating successful behavior is a natural and frequently applied approach to trust in when facing scenarios for which we have little or no experience upon which we can base our d...
Heiner Ackermann, Petra Berenbrink, Simon Fischer,...