50 search results - page 2 / 10 » Nash Convergence of Gradient Dynamics in General-Sum Games |
SAGT
2009
Springer
13 years 9 months ago
2009
Springer
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 ...
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
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...
SAGT
2010
Springer
13 years 3 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
CORR
2011
Springer
13 years 7 days ago
2011
Springer
We consider a network composed of two interfering point-to-point links where the two transmitters can exploit one common relay node to improve their individual transmission rate. ...