Approximating Game-Theoretic Optimal Strategies for Full-scale Poker (2003)
Cached
Download Links
by
D. Billings
,
N. Burch
,
A. Davidson
,
R. Holte
,
J. Schaeffer
,
T. Schauenberg
,
D. Szafron
| Venue: | IN INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE |
| Citations: | 104 - 16 self |
BibTeX
@INPROCEEDINGS{Billings03approximatinggame-theoretic,
author = {D. Billings and N. Burch and A. Davidson and R. Holte and J. Schaeffer and T. Schauenberg and D. Szafron},
title = {Approximating Game-Theoretic Optimal Strategies for Full-scale Poker},
booktitle = {IN INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE},
year = {2003},
pages = {661--668},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The computation of the first complete approximations of game-theoretic optimal strategies for fullscale poker is addressed. Several abstraction techniques are combined to represent the game of 2-player Texas Hold'em, having size O(10^18), using closely related models each having size .
Citations
| 457 | Equilibrium Points in N-Person Games - Nash - 1950 |
| 105 | Representations and Solutions for Game-Theoretic Problems - Koller, Pfeffer - 1997 |
| 89 | The challenge of poker - Billings, Davidson, et al. |
| 76 | Fast algorithms for finding randomized strategies in game trees - Koller, Megiddo, et al. - 1994 |
| 72 | The complexity of two-person zerosum games in extensive form - Koller, Megiddo - 1992 |
| 27 | Simplified two-person poker. Contributions to the Theory of - KUHN - 1950 |
| 22 | The first international RoShamBo programming competition - Billings - 2000 |
| 9 | Optimal heads-up preflop poker - Selby - 1999 |
| 9 | Nash Equilibrium of Texas Hold’em Poker. Undergraduate thesis - Takusagawa - 2000 |
| 6 | Solutions of some three-person stud and draw poker - Sakaguchi, Sakai - 1992 |
| 6 | Abstraction models for game theoretic poker - Shi, Littman - 2001 |
| 2 | Texas Hold’em for the Advanced Player. Two Plus Two Publishing, 2nd edition - Sklansky, Malmuth - 1994 |
