144 search results - page 14 / 29 » Computing Nash Equilibria of Action-Graph Games |
SIAMCOMP
2010
13 years 5 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
CG
2006
Springer
13 years 11 months ago
2006
Springer
We show that a proper equilibrium of a matrix game can be found in polynomial time by solving a linear (in the number of pure strategies of the two players) number of linear progra...
PODC
2003
ACM
14 years 19 days ago
2003
ACM
We introduce a novel game that models the creation of Internet-like networks by selfish node-agents without central design or coordination. Nodes pay for the links that they esta...
FMCO
2004
Springer
14 years 24 days ago
2004
Springer
In 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if each player attempts to maximize her payoff. In contrast to classical game theory, we ...
COCOON
2008
Springer
13 years 9 months ago
2008
Springer
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...