294 search results - page 15 / 59 » The complexity of computing a Nash equilibrium |
SIROCCO
2008
14 years 11 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
101
click to vote
SAGT
2010
Springer
14 years 8 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
NETCOOP
2007
Springer
15 years 3 months ago
2007
Springer
We consider jamming in wireless networks with transmission cost for both transmitter and jammer. We use the framework of non-zerosum games. In particular, we prove the existence an...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Game-theoretic solution concepts, such as Nash equilibrium, are playing an ever increasing role in the study of systems of autonomous computational agents. A common criticism of N...
SPAA
2006
ACM
15 years 3 months ago
2006
ACM
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...