21 search results - page 1 / 5 » Social Learning Algorithms Reaching Nash Equilibrium in Symm... |
EVOW
2010
Springer
13 years 10 months ago
2010
Springer
JAMDS
2010
12 years 11 months ago
2010
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...
ESA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In this paper we consider Nash Equilibria for the selfish routing model proposed in [12], where a set of n users with tasks of different size try to access m parallel l...
ATAL
2006
Springer
13 years 8 months ago
2006
Springer
In many Multi-Agent Systems (MAS), agents (even if selfinterested) need to cooperate in order to maximize their own utilities. Most of the multi-agent learning algorithms focus on...