Andrew Gilpin

发表

A Texas Hold'em poker player based on automated abstraction and real-time equilibrium computation

Tuomas Sandholm, Andrew Gilpin, T. Sandholm, 2006, AAMAS '06.

Information-theoretic approaches to branching in search

Tuomas Sandholm, Andrew Gilpin, 2011, Discret. Optim..

Optimal Rhode Island Hold'em Poker

Tuomas Sandholm, Andrew Gilpin, T. Sandholm, 2005, AAAI.

Lossless abstraction of imperfect information games

Tuomas Sandholm, Andrew Gilpin, T. Sandholm, 2007, JACM.

Smoothing Techniques for Computing Nash Equilibria of Sequential Games

Javier Peña, Tuomas Sandholm, Andrew Gilpin, 2010, Math. Oper. Res..

Tool solutions for machining composites

Andrew Gilpin, 2009 .

GS3 and Tartanian: game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs

Troels Bjerre Lund, Tuomas Sandholm, Andrew Gilpin, 2008, AAMAS.

A heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding programs

Troels Bjerre Lund, Tuomas Sandholm, Andrew Gilpin, 2008, AAMAS.

Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation

Tuomas Sandholm, Andrew Gilpin, T. Sandholm, 2003, AAMAS '06.

First-order algorithm with $${\mathcal{O}({\rm ln}(1{/}\epsilon))}$$ convergence for $${\epsilon}$$-equilibrium in two-person zero-sum games

Javier Peña, Tuomas Sandholm, Andrew Gilpin, 2012, Math. Program..

Speeding up gradient-based algorithms for sequential games

Tuomas Sandholm, Andrew Gilpin, 2010, AAMAS.

Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker

Tuomas Sandholm, Andrew Gilpin, T. Sandholm, 2007, AAMAS '07.

A GRADIENT-BASED APPROACH FOR COMPUTING NASH EQUILIBRIA OF LARGE SEQUENTIAL GAMES

Javier Peña, Andrew Gilpin, Samid Hoda, 2007 .

Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker

Tuomas Sandholm, Andrew Gilpin, T. Sandholm, 2008, AAAI.

First-Order Algorithm with O(ln(1/e)) Convergence for e-Equilibrium in Two-Person Zero-Sum Games

Javier Peña, Tuomas Sandholm, Andrew Gilpin, 2008, AAAI.

CABOB: A Fast Optimal Algorithm for Combinatorial Auctions

David Levine, Subhash Suri, Tuomas Sandholm, 2001, IJCAI.

CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions

David Levine, Subhash Suri, Tuomas Sandholm, 2005, Manag. Sci..

Solving two-person zero-sum repeated games of incomplete information

Tuomas Sandholm, Andrew Gilpin, T. Sandholm, 2008, AAMAS.

Mixed-Integer Programming Methods for Finding Nash Equilibria

Vincent Conitzer, Tuomas Sandholm, Andrew Gilpin, 2005, AAAI.

Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation

Tuomas Sandholm, Andrew Gilpin, 2003, AMEC.

Algorithms for abstracting and solving imperfect information games

Tuomas Sandholm, Andrew Gilpin, T. Sandholm, 2009 .

A Competitive Texas Hold'em Poker Player via Automated Abstraction and Real-Time Equilibrium Computation

Tuomas Sandholm, Andrew Gilpin, T. Sandholm, 2006, AAAI.

Finding equilibria in large sequential games of imperfect information

Tuomas Sandholm, Andrew Gilpin, T. Sandholm, 2006, EC '06.

Information-theoretic approaches to branching in search

Tuomas Sandholm, Andrew Gilpin, T. Sandholm, 2006, AAMAS '06.

Winner determination in combinatorial auction generalizations

David Levine, Subhash Suri, Tuomas Sandholm, 2002, AAMAS '02.

Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games

Javier Peña, Tuomas Sandholm, Andrew Gilpin, 2007, WINE.

Potential-Aware Automated Abstraction of Sequential Games, and Holistic Equilibrium Analysis of Texas Hold'em Poker

Troels Bjerre Lund, Tuomas Sandholm, Andrew Gilpin, 2007, AAAI.