294 search results - page 9 / 59 » The complexity of computing a Nash equilibrium |
GLOBECOM
2008
IEEE
15 years 4 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 ...
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
The Lemke
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
We suggest that extending Muller games with preference ordering for players is a natural way to reason about unbounded duration games. In this context, we look at the standard solu...
SIGECOM
2006
ACM
15 years 3 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...