53 search results - page 4 / 11 » A Polynomial-time Nash Equilibrium Algorithm for Repeated St... |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
— We consider the issue of fair share of the spectrum opportunity for the case of spectrum-overlay cognitive radio networks. Owing to the decentralized nature of the network, we ...
SIGECOM
2003
ACM
14 years 27 days ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
WINE
2010
Springer
13 years 5 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
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...