CABOB: A Fast Optimal Algorithm for Combinatorial Auctions. - Tuomas Sandholm; Subhash Suri; Andrew Gilpin; David Levine (IJCAI, 2001)

Winner determination in combinatorial auction generalizations. - Tuomas Sandholm; Subhash Suri; Andrew Gilpin; David Levine (AAMAS, 2002)

Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation. - Tuomas Sandholm; Andrew Gilpin (AMEC, 2003)

Optimal Rhode Island Hold'em Poker. - Andrew Gilpin; Tuomas Sandholm (AAAI, 2005)

Mixed-Integer Programming Methods for Finding Nash Equilibria. - Tuomas Sandholm; Andrew Gilpin; Vincent Conitzer (AAAI, 2005)

CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions. - Tuomas Sandholm; Subhash Suri; Andrew Gilpin; David Levine (Manag. Sci., 2005)

A Competitive Texas Hold'em Poker Player via Automated Abstraction and Real-Time Equilibrium Computation. - Andrew Gilpin; Tuomas Sandholm (AAAI, 2006)

A Texas Hold'em poker player based on automated abstraction and real-time equilibrium computation. - Andrew Gilpin; Tuomas Sandholm (AAMAS, 2006)

Finding equilibria in large sequential games of imperfect information. - Andrew Gilpin; Tuomas Sandholm (EC, 2006)

Potential-Aware Automated Abstraction of Sequential Games, and Holistic Equilibrium Analysis of Texas Hold'em Poker. - Andrew Gilpin; Tuomas Sandholm; Troels Bjerre Sørensen (AAAI, 2007)

Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker. - Andrew Gilpin; Tuomas Sandholm (AAMAS, 2007)

Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games. - Andrew Gilpin; Samid Hoda; Javier Peña 001; Tuomas Sandholm (WINE, 2007)

Lossless abstraction of imperfect information games. - Andrew Gilpin; Tuomas Sandholm (J. ACM, 2007)

First-Order Algorithm with O(ln(1/e)) Convergence for e-Equilibrium in Two-Person Zero-Sum Games. - Andrew Gilpin; Javier Peña 001; Tuomas Sandholm (AAAI, 2008)

Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker. - Andrew Gilpin; Tuomas Sandholm (AAAI, 2008)

Solving two-person zero-sum repeated games of incomplete information. - Andrew Gilpin; Tuomas Sandholm (AAMAS (2), 2008)

A heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding programs. - Andrew Gilpin; Tuomas Sandholm; Troels Bjerre Sørensen (AAMAS (2), 2008)

GS3 and Tartanian: game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs. - Andrew Gilpin; Tuomas Sandholm; Troels Bjerre Sørensen (AAMAS (Demos), 2008)

Speeding up gradient-based algorithms for sequential games. - Andrew Gilpin; Tuomas Sandholm (AAMAS, 2010)

Smoothing Techniques for Computing Nash Equilibria of Sequential Games. - Samid Hoda; Andrew Gilpin; Javier Peña 001; Tuomas Sandholm (Math. Oper. Res., 2010)

Information-theoretic approaches to branching in search. - Andrew Gilpin; Tuomas Sandholm (Discret. Optim., 2011)

First-order algorithm with 𝒪(ln(1/ε)) convergence for ε-equilibrium in two-person zero-sum games. - Andrew Gilpin; Javier Peña 001; Tuomas Sandholm (Math. Program., 2012)