Andrew Gilpin

Publication Activity (10 Years)

Years Active: 2001-2012
Publications (10 Years): 0

Top Topics

Iterative Algorithms

Faster Convergence

Top Venues

Publications

Andrew Gilpin, Javier Peña, Tuomas Sandholm
First-order algorithm with 𝒪(ln(1/ε)) convergence for ε-equilibrium in two-person zero-sum games. Math. Program. 133 (1-2) (2012)
Andrew Gilpin, Tuomas Sandholm
Information-theoretic approaches to branching in search. Discret. Optim. 8 (2) (2011)
Samid Hoda, Andrew Gilpin, Javier Peña, Tuomas Sandholm
Smoothing Techniques for Computing Nash Equilibria of Sequential Games. Math. Oper. Res. 35 (2) (2010)
Andrew Gilpin, Tuomas Sandholm
Speeding up gradient-based algorithms for sequential games. AAMAS (2010)
Andrew Gilpin, Tuomas Sandholm
Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker. AAAI (2008)
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)
Andrew Gilpin, Tuomas Sandholm
Solving two-person zero-sum repeated games of incomplete information. AAMAS (2) (2008)
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)
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)
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)
Andrew Gilpin, Samid Hoda, Javier Peña, Tuomas Sandholm
Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games. WINE (2007)
Andrew Gilpin, Tuomas Sandholm
Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker. AAMAS (2007)
Andrew Gilpin, Tuomas Sandholm
Lossless abstraction of imperfect information games. J. ACM 54 (5) (2007)
Andrew Gilpin, Tuomas Sandholm
Information-Theoretic Approaches to Branching in Search. IJCAI (2007)
Tuomas Sandholm, Andrew Gilpin
Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation. AAMAS (2006)
Andrew Gilpin, Tuomas Sandholm
A Texas Hold'em poker player based on automated abstraction and real-time equilibrium computation. AAMAS (2006)
Andrew Gilpin, Tuomas Sandholm
A Competitive Texas Hold'em Poker Player via Automated Abstraction and Real-Time Equilibrium Computation. AAAI (2006)
Andrew Gilpin, Tuomas Sandholm
Finding equilibria in large sequential games of imperfect information. EC (2006)
Andrew Gilpin, Tuomas Sandholm
Information-theoretic approaches to branching in search. AAMAS (2006)
Tuomas Sandholm, Andrew Gilpin, Vincent Conitzer
Mixed-Integer Programming Methods for Finding Nash Equilibria. AAAI (2005)
Andrew Gilpin, Tuomas Sandholm
Optimal Rhode Island Hold'em Poker. AAAI (2005)
Tuomas Sandholm, Andrew Gilpin
Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation. Computing and Markets (2005)
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine
CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions. Manag. Sci. 51 (3) (2005)
Tuomas Sandholm, Andrew Gilpin
Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation. AMEC (2003)
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine
Winner determination in combinatorial auction generalizations. AAMAS (2002)
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions. IJCAI (2001)