5 search results - page 1 / 1 » Endgame Solving in Large Imperfect-Information Games |
SIGECOM
2006
ACM
13 years 10 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...
JACM
2007
13 years 4 months ago
2007
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
AAAI
1998
13 years 6 months ago
1998
Weexaminethree heuristic algorithms for gameswith imperfect information: Monte-carlo sampling, and two newalgorithms wecall vector minimaxingand payoffreduction minimaxing. Wecomp...
AAI
2010
13 years 1 months ago
2010
Here, we present a constrained object recognition task that has been robustly solved largely with simple machine learning methods, using a small corpus of about 100 images taken u...
AAAI
2010
13 years 6 months ago
2010
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...