179 search results - page 30 / 36 » On Learning Algorithms for Nash Equilibria |
ICML
2003
IEEE
16 years 15 days ago
2003
IEEE
A satisfactory multiagent learning algorithm should, at a minimum, learn to play optimally against stationary opponents and converge to a Nash equilibrium in self-play. The algori...
104
click to vote
CSFW
2008
IEEE
15 years 6 months ago
2008
IEEE
In various settings, such as when customers use the same passwords at several independent web sites, security decisions by one organization may have a significant impact on the s...
107
click to vote
TCOM
2010
14 years 10 months ago
2010
Abstract—This paper studies a constrained optical signal-tonoise ratio (OSNR) optimization problem in optical networks from the perspective of system performance. A system optimi...
LAMAS
2005
Springer
15 years 5 months ago
2005
Springer
We present a new multiagent learning algorithm, RVσ(t), that builds on an earlier version, ReDVaLeR . ReDVaLeR could guarantee (a) convergence to best response against stationary ...
111
click to vote
ATAL
2006
Springer
15 years 3 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...