50 search results - page 3 / 10 » Nash Convergence of Gradient Dynamics in General-Sum Games |
WINE
2009
Springer
14 years 20 days ago
2009
Springer
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...
ANOR
2005
13 years 6 months ago
2005
The main objects here are finite-strategy games in which entropic terms are subtracted from the payoffs. After such subtraction each Nash equilibrium solves an explicit, unconstra...
ATAL
2003
Springer
13 years 11 months ago
2003
Springer
Multiagent learning literature has investigated iterated twoplayer games to develop mechanisms that allow agents to learn to converge on Nash Equilibrium strategy profiles. Such ...
SIGECOM
2010
ACM
13 years 6 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
AAAI
2010
13 years 7 months ago
2010
Due to the non-stationary environment, learning in multi-agent systems is a challenging problem. This paper first introduces a new gradient-based learning algorithm, augmenting th...