533 search results - page 12 / 107 » Playing games with approximation algorithms |
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
FUN
2010
Springer
13 years 5 months ago
2010
Springer
The bank director was pretty upset noticing Joe, the system administrator, spending his spare time playing Mastermind, an old useless game of the 70ies. He had fought the instinct ...
WDAG
2009
Springer
14 years 2 months ago
2009
Springer
We study the convergence times of dynamics in games involving graphical relationships of players. Our model of local interaction games generalizes a variety of recently studied ga...
CIG
2005
IEEE
14 years 1 months ago
2005
IEEE
Ms. Pac-Man is a challenging, classic arcade game with a certain cult status. This paper reports attempts to evolve a Pac-Man player, where the control algorithm uses a neural net...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...