68 search results - page 9 / 14 » New Algorithms for Approximate Nash Equilibria in Bimatrix G... |
SODA
2010
ACM
13 years 5 months ago
2010
ACM
We consider computational aspects of alternating move games, repeated games in which players take actions at alternating time steps rather than playing simultaneously. We show tha...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
ESA
2009
Springer
14 years 1 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...
ECML
2003
Springer
14 years 17 days ago
2003
Springer
Abstract. Most of multi-agent reinforcement learning algorithms aim to converge to a Nash equilibrium, but a Nash equilibrium does not necessarily mean a desirable result. On the o...
AAAI
2010
13 years 7 months ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...