129 search results - page 1 / 26 » Games, geometry, and the computational complexity of finding... |
TARK
2007
Springer
15 years 6 months ago
2007
Springer
103
Voted
SIGECOM
2006
ACM
15 years 6 months ago
2006
ACM
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
106
Voted
TCS
2008
15 years 9 days ago
2008
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
95
Voted
ICALP
2009
Springer
16 years 20 days ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...
118
click to vote
JSAC
2008
15 years 11 days ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...