Search Sciweavers | Sciweavers

19 search results - page 1 / 4

» Lossless abstraction of imperfect information games

click to vote

JACM
2007

160views more JACM 2007»

Lossless abstraction of imperfect information games

13 years 4 months ago

Download www.cs.cmu.edu

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

claim paper

Read More »

click to vote

AAAI
2008

152views Intelligent Agents» more AAAI 2008»

Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using

13 years 7 months ago

Download www.cs.cmu.edu

ion-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker Andrew Gilpin and Tuomas Sandholm Computer Science Dep...

Andrew Gilpin, Tuomas Sandholm

claim paper

Read More »

click to vote

SIGECOM
2006
ACM

135views ECommerce» more SIGECOM 2006»

Finding equilibria in large sequential games of imperfect information

13 years 10 months ago

Download www.cs.cmu.edu

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

claim paper

Read More »

click to vote

ATAL
2007
Springer

106views Intelligent Agents» more ATAL 2007»

Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker

13 years 8 months ago

Download www.cs.cmu.edu

Andrew Gilpin, Tuomas Sandholm

claim paper

Read More »