224 search results - page 13 / 45 » On Nash-Equilibria of Approximation-Stable Games |
SODA
2012
ACM
11 years 10 months ago
2012
ACM
A Nash Equilibrium is a joint strategy profile at which each agent myopically plays a best response to the other agents’ strategies, ignoring the possibility that deviating fro...
SIGECOM
2011
ACM
12 years 10 months ago
2011
ACM
: Many natural games can have a dramatic difference between the quality of their best and worst Nash equilibria, even in pure strategies. Yet, nearly all work to date on dynamics s...
SAGT
2010
Springer
13 years 5 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
SAGT
2010
Springer
13 years 5 months ago
2010
Springer
The class of weakly acyclic games, which includes potential games and dominance-solvable games, captures many practical application domains. Informally, a weakly acyclic game is on...
SIGECOM
2010
ACM
14 years 9 days ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...