55 search results - page 4 / 11 » Settling the Complexity of Computing Two-Player Nash Equilib... |
ECAI
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players...
JSAC
2008
13 years 10 months 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...
FCT
2005
Springer
14 years 4 months ago
2005
Springer
FOCS
2007
IEEE
14 years 5 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
SIAMCOMP
2010
13 years 9 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...