38 search results - page 2 / 8 » Optimality and Complexity of Pure Nash Equilibria in the Cov... |
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
SIGECOM
2010
ACM
13 years 10 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
FOCS
2010
IEEE
13 years 3 months ago
2010
IEEE
Generalized Second Price Auction, also knows as Ad Word auctions, and its variants has been the main mechanism used by search companies to auction positions for sponsored search l...
STACS
2007
Springer
13 years 11 months ago
2007
Springer
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...
CDC
2009
IEEE
13 years 10 months ago
2009
IEEE
— We formulate a coverage optimization problem for mobile visual sensor networks as a repeated multi-player game. Each visual sensor tries to optimize its own coverage while mini...