Name
Abstract | ||
|---|---|---|
The computation of the first complete approximations of game-theoretic optimal strategies for full-scale poker is addressed. Several abstraction techniques are combined to represent the game of 2-player Texas Hold'em, having size O(1018), using closely related models each having size O(1O7). Despite the reduction in size by a factor of 100 billion, the resulting models retain the key properties and structure of the real game. Linear programming solutions to the abstracted game are used to create substantially improved poker-playing programs, able to defeat strong human players and be competitive against world-class opponents. |
Year | Venue | Keywords |
|---|---|---|
2003 | IJCAI | linear programming solution,key property,abstracted game,size o,complete approximation,2-player texas,full-scale poker,game-theoretic optimal strategy,abstraction technique,real game,relational model |
Field | DocType | Citations |
Texas hold 'em,Abstraction,Full scale,Computer science,Approximations of π,Game theoretic,Linear programming,Artificial intelligence,Machine learning,Computation | Conference | 121 |
PageRank | References | Authors |
11.31 | 5 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Darse Billings | 1 | 406 | 45.35 |
| Neil Burch | 2 | 121 | 11.31 |
| Aaron Davidson | 3 | 121 | 11.31 |
| R. C. Holte | 4 | 310 | 60.20 |
| Jonathan Schaeffer | 5 | 361 | 41.63 |
| Terence Schauenberg | 6 | 121 | 11.31 |
| D. Szafron | 7 | 1579 | 210.88 |