Sciweavers

5 search results - page 1 / 1
» Endgame Solving in Large Imperfect-Information Games
Sort
View
85
Voted
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
15 years 4 months ago
Finding equilibria in large sequential games of imperfect information
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...
Andrew Gilpin, Tuomas Sandholm
JACM
2007
160views more  JACM 2007»
14 years 10 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
77
Voted
AAAI
1998
14 years 11 months ago
Finding Optimal Strategies for Imperfect Information Games
Weexaminethree heuristic algorithms for gameswith imperfect information: Monte-carlo sampling, and two newalgorithms wecall vector minimaxingand payoffreduction minimaxing. Wecomp...
Ian Frank, David A. Basin, Hitoshi Matsubara
83
Voted
AAI
2010
195views more  AAI 2010»
14 years 7 months ago
Automatic Extraction of Go Game Positions from Images: a Multi-Strategical Approach to Constrained Multi-Object Recognition
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...
Alexander K. Seewald
85
Voted
AAAI
2010
14 years 11 months ago
Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search
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 ...
Jeffrey Richard Long, Nathan R. Sturtevant, Michae...