234 search results - page 8 / 47 » A polynomial-time nash equilibrium algorithm for repeated ga... |
JAMDS
2010
15 years 23 days ago
2010
161
click to vote
WINE
2007
Springer
16 years 2 days 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 ...
147
click to vote
ESA
2009
Springer
16 years 16 days 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...