34 search results - page 3 / 7 » A Polynomial Time Algorithm for Finding Nash Equilibria in P... |
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
Recently, Hazan and Krauthgamer showed [12] that if, for a fixed small ε, an ε-best ε-approximate Nash equilibrium can be found in polynomial time in two-player games, then it ...
UAI
2004
13 years 9 months ago
2004
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
SIGECOM
2006
ACM
14 years 1 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...
JSAC
2008
13 years 7 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...
SODA
2010
ACM
13 years 5 months ago
2010
ACM
We consider computational aspects of alternating move games, repeated games in which players take actions at alternating time steps rather than playing simultaneously. We show tha...