3 search results - page 1 / 1 » Locally 2-Dimensional Sperner Problems Complete for the Poly... |
CIAC
2006
Springer
13 years 9 months ago
2006
Springer
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—Localization in the presence of malicious beacon nodes is an important problem in wireless networks. Although significant progress has been made on this problem, some fundament...