179 search results - page 22 / 36 » On Learning Algorithms for Nash Equilibria |
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
116
click to vote
SAGT
2010
Springer
14 years 10 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
86
Voted
UAI
2004
15 years 1 months ago
2004
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
101
click to vote
ESA
2008
Springer
15 years 1 months ago
2008
Springer
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
96
Voted
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— Channel allocation was extensively studied in the framework of cellular networks. But the emergence of new system concepts, such as cognitive radio systems, has brought this to...