234 search results - page 1 / 47 » A polynomial-time nash equilibrium algorithm for repeated ga... |
NIPS
2003
14 years 16 days ago
2003
We study how to learn to play a Pareto-optimal strict Nash equilibrium when there exist multiple equilibria and agents may have different preferences among the equilibria. We focu...
JGAA
2007
13 years 11 months ago
2007
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
SIGECOM
2003
ACM
14 years 4 months ago
2003
ACM
UAI
2008
14 years 17 days ago
2008
SODA
2010
ACM
13 years 9 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...