234 search results - page 8 / 47 » A polynomial-time nash equilibrium algorithm for repeated ga... |
EVOW
2010
Springer
15 years 2 months ago
2010
Springer
JAMDS
2010
14 years 4 months ago
2010
WINE
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
The Lemke
ESA
2009
Springer
15 years 4 months ago
2009
Springer
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...