533 search results - page 30 / 107 » Playing games with approximation algorithms |
CIG
2005
IEEE
14 years 1 months ago
2005
IEEE
A newly designed game is introduced, which feels like Backgammon, but has a simplified rule set. Unlike earlier attempts at simplifying the game, Nannon maintains enough features a...
COCO
2008
Springer
13 years 9 months ago
2008
Springer
We study the approximability of predicates on k variables from a domain [q], and give a new sufficient condition for such predicates to be approximation resistant under the Unique...
SBRN
2002
IEEE
14 years 19 days ago
2002
IEEE
This article presents the system “Neural Connect 4”, a program that plays the game Connect Four. This system employs the multilayer perceptron architecture which is learning t...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
Learning in many multi-agent settings is inherently repeated play. This calls into question the naive application of single play Nash equilibria in multi-agent learning and sugges...
AI
2004
Springer
13 years 7 months ago
2004
Springer
Efficient Learning Equilibrium (ELE) is a natural solution concept for multi-agent encounters with incomplete information. It requires the learning algorithms themselves to be in ...