894 search results - page 91 / 179 » Game Theory with Costly Computation |
111
click to vote
SAGT
2010
Springer
15 years 10 days ago
2010
Springer
Recent results showing PPAD-completeness of the problem of computing an equilibrium for Fisher’s market model under additively separable, piecewise-linear, concave utilities (pl...
139
click to vote
MOBIHOC
2012
ACM
13 years 4 months ago
2012
ACM
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
174
click to vote
DIMACS
1996
15 years 3 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
122
click to vote
SIGECOM
2003
ACM
15 years 7 months 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...
139
click to vote
SAGT
2010
Springer
15 years 10 days 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 ...