224 search results - page 15 / 45 » On Nash-Equilibria of Approximation-Stable Games |
CDC
2009
IEEE
14 years 7 days ago
2009
IEEE
— Achieving the Nash equilibria for single objective games is known to be a computationally difficult problem. However there is a special class of equilibria called evolutionary...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
Cognitive radio gives users the ability to switch channels and make use of dynamic spectral opportunities. However, switching channels takes time, and may disrupt the quality of a...
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...