50 search results - page 4 / 10 » Nash Convergence of Gradient Dynamics in General-Sum Games |
SIGECOM
2011
ACM
13 years 1 months ago
2011
ACM
: Many natural games can have a dramatic difference between the quality of their best and worst Nash equilibria, even in pure strategies. Yet, nearly all work to date on dynamics s...
INFOCOM
1995
IEEE
14 years 2 months ago
1995
IEEE
— We consider a multiuser network that is shared by noncooperative users. Each user sets up virtual paths that optimize its own selfish performance measure. This measure account...
ATAL
2007
Springer
14 years 5 months ago
2007
Springer
Regret based algorithms have been proposed to control a wide variety of multi-agent systems. The appeal of regretbased algorithms is that (1) these algorithms are easily implement...
ECML
2003
Springer
14 years 4 months ago
2003
Springer
Abstract. Most of multi-agent reinforcement learning algorithms aim to converge to a Nash equilibrium, but a Nash equilibrium does not necessarily mean a desirable result. On the o...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
This paper studies the effects of introducing altruistic agents into atomic congestion games. Altruistic behavior is modeled by a trade-off between selfish and social objectives. ...