30 search results - page 2 / 6 » A Polynomial-Time Algorithm for Action Graph Games |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
FUN
2010
Springer
13 years 10 months ago
2010
Springer
The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a singl...
APPROX
2009
Springer
13 years 12 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 ...
COCO
2010
Springer
13 years 9 months ago
2010
Springer
We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programmi...
SIGECOM
2006
ACM
13 years 11 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...