179 search results - page 6 / 36 » On Learning Algorithms for Nash Equilibria |
79
Voted
ATAL
2004
Springer
15 years 2 months ago
2004
Springer
This paper investigates a relatively new direction in Multiagent Reinforcement Learning. Most multiagent learning techniques focus on Nash equilibria as elements of both the learn...
97
Voted
ECCC
2006
14 years 9 months ago
2006
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
Learning in many multi-agent settings is inherently repeated play. This calls into question the naive application of single play Nash equilibria in multi-agent learning and sugges...
STOC
2005
ACM
15 years 9 months ago
2005
ACM
We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is ( ...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...