| 2008 |
|---|
| 21 | | Andrew Gilpin,
Tuomas Sandholm:
Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker.
AAAI 2008: 1454-1457 |
| 20 | | Andrew Gilpin,
Javier Peña,
Tuomas Sandholm:
First-Order Algorithm with O(ln(1/e)) Convergence for e-Equilibrium in Two-Person Zero-Sum Games.
AAAI 2008: 75-82 |
| 19 | EE | Andrew Gilpin,
Tuomas Sandholm:
Solving two-person zero-sum repeated games of incomplete information.
AAMAS (2) 2008: 903-910 |
| 18 | EE | Andrew Gilpin,
Tuomas Sandholm,
Troels Bjerre Sørensen:
A heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding programs.
AAMAS (2) 2008: 911-918 |
| 17 | EE | Andrew Gilpin,
Tuomas Sandholm,
Troels Bjerre Sørensen:
GS3 and Tartanian: game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs.
AAMAS (Demos) 2008: 1647-1648 |
| 2007 |
|---|
| 16 | | Andrew Gilpin,
Tuomas Sandholm,
Troels Bjerre Sørensen:
Potential-Aware Automated Abstraction of Sequential Games, and Holistic Equilibrium Analysis of Texas Hold'em Poker.
AAAI 2007: 50-57 |
| 15 | EE | Andrew Gilpin,
Tuomas Sandholm:
Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker.
AAMAS 2007: 192 |
| 14 | EE | Andrew Gilpin,
Tuomas Sandholm:
Information-Theoretic Approaches to Branching in Search.
IJCAI 2007: 2286-2292 |
| 13 | EE | Andrew Gilpin,
Samid Hoda,
Javier Peña,
Tuomas Sandholm:
Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games.
WINE 2007: 57-69 |
| 12 | EE | Andrew Gilpin,
Tuomas Sandholm:
Lossless abstraction of imperfect information games.
J. ACM 54(5): (2007) |
| 2006 |
|---|
| 11 | | Andrew Gilpin,
Tuomas Sandholm:
A Competitive Texas Hold'em Poker Player via Automated Abstraction and Real-Time Equilibrium Computation.
AAAI 2006 |
| 10 | EE | Tuomas Sandholm,
Andrew Gilpin:
Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation.
AAMAS 2006: 1127-1134 |
| 9 | EE | Andrew Gilpin,
Tuomas Sandholm:
A Texas Hold'em poker player based on automated abstraction and real-time equilibrium computation.
AAMAS 2006: 1453-1454 |
| 8 | EE | Andrew Gilpin,
Tuomas Sandholm:
Information-theoretic approaches to branching in search.
AAMAS 2006: 545-547 |
| 7 | EE | Andrew Gilpin,
Tuomas Sandholm:
Finding equilibria in large sequential games of imperfect information.
ACM Conference on Electronic Commerce 2006: 160-169 |
| 2005 |
|---|
| 6 | | Andrew Gilpin,
Tuomas Sandholm:
Optimal Rhode Island Hold'em Poker.
AAAI 2005: 1684-1685 |
| 5 | | Tuomas Sandholm,
Andrew Gilpin,
Vincent Conitzer:
Mixed-Integer Programming Methods for Finding Nash Equilibria.
AAAI 2005: 495-501 |
| 4 | EE | Tuomas Sandholm,
Andrew Gilpin:
Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation.
Computing and Markets 2005 |
| 2003 |
|---|
| 3 | EE | Tuomas Sandholm,
Andrew Gilpin:
Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation.
AMEC 2003: 73-91 |
| 2002 |
|---|
| 2 | EE | Tuomas Sandholm,
Subhash Suri,
Andrew Gilpin,
David Levine:
Winner determination in combinatorial auction generalizations.
AAMAS 2002: 69-76 |
| 2001 |
|---|
| 1 | | Tuomas Sandholm,
Subhash Suri,
Andrew Gilpin,
David Levine:
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions.
IJCAI 2001: 1102-1108 |
