Andrew Gilpin

26 papers A* 9A 6Journal 5Unranked 6
YearRankTypeTitle / Venue / Authors
2012 J jnl
First-order algorithm with 𝒪(ln(1/ε)) convergence for ε-equilibrium in two-person zero-sum games.
Math. Program.
Andrew Gilpin, Javier Peña, Tuomas Sandholm
2011 J jnl
Information-theoretic approaches to branching in search.
Discret. Optim.
Andrew Gilpin, Tuomas Sandholm
2010 J jnl
Smoothing Techniques for Computing Nash Equilibria of Sequential Games.
Math. Oper. Res.
Samid Hoda, Andrew Gilpin, Javier Peña, Tuomas Sandholm
2010 A conf
Speeding up gradient-based algorithms for sequential games.
AAMAS
Andrew Gilpin, Tuomas Sandholm
2008 — conf
A heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding programs.
AAMAS (2)
Andrew Gilpin, Tuomas Sandholm, Troels Bjerre Sørensen
2008 A* conf
Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker.
AAAI
Andrew Gilpin, Tuomas Sandholm
2008 A* conf
First-Order Algorithm with O(ln(1/e)) Convergence for e-Equilibrium in Two-Person Zero-Sum Games.
AAAI
Andrew Gilpin, Javier Peña, Tuomas Sandholm
2008 — conf
GS3 and Tartanian: game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs.
AAMAS (Demos)
Andrew Gilpin, Tuomas Sandholm, Troels Bjerre Sørensen
2008 — conf
Solving two-person zero-sum repeated games of incomplete information.
AAMAS (2)
Andrew Gilpin, Tuomas Sandholm
2007 A conf
Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker.
AAMAS
Andrew Gilpin, Tuomas Sandholm
2007 — conf
Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games.
WINE
Andrew Gilpin, Samid Hoda, Javier Peña, Tuomas Sandholm
2007 A* conf
Information-Theoretic Approaches to Branching in Search.
IJCAI
Andrew Gilpin, Tuomas Sandholm
2007 J jnl
Lossless abstraction of imperfect information games.
J. ACM
Andrew Gilpin, Tuomas Sandholm
2007 A* conf
Potential-Aware Automated Abstraction of Sequential Games, and Holistic Equilibrium Analysis of Texas Hold'em Poker.
AAAI
Andrew Gilpin, Tuomas Sandholm, Troels Bjerre Sørensen
2006 A* conf
A Competitive Texas Hold'em Poker Player via Automated Abstraction and Real-Time Equilibrium Computation.
AAAI
Andrew Gilpin, Tuomas Sandholm
2006 A conf
A Texas Hold'em poker player based on automated abstraction and real-time equilibrium computation.
AAMAS
Andrew Gilpin, Tuomas Sandholm
2006 A* conf
Finding equilibria in large sequential games of imperfect information.
EC
Andrew Gilpin, Tuomas Sandholm
2006 A conf
Information-theoretic approaches to branching in search.
AAMAS
Andrew Gilpin, Tuomas Sandholm
2006 A conf
Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation.
AAMAS
Tuomas Sandholm, Andrew Gilpin
2005 J jnl
CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions.
Manag. Sci.
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine
2005 A* conf
Mixed-Integer Programming Methods for Finding Nash Equilibria.
AAAI
Tuomas Sandholm, Andrew Gilpin, Vincent Conitzer
2005 A* conf
Optimal Rhode Island Hold'em Poker.
AAAI
Andrew Gilpin, Tuomas Sandholm
2005 — conf
Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation.
Computing and Markets
Tuomas Sandholm, Andrew Gilpin
2003 — conf
Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation.
AMEC
Tuomas Sandholm, Andrew Gilpin
2002 A conf
Winner determination in combinatorial auction generalizations.
AAMAS
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine
2001 A* conf
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions.
IJCAI
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine