Andrew Gilpin

According to our database, Andrew Gilpin authored at least 22 papers between 2001 and 2012.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2012

First-order algorithm with 𝒪(ln(1/ε)) convergence for ε-equilibrium in two-person zero-sum games.

Andrew Gilpin, Javier Peña, Tuomas Sandholm

Math. Program., 2012

2011

Information-theoretic approaches to branching in search.

Andrew Gilpin, Tuomas Sandholm

Discret. Optim., 2011

2010

Smoothing Techniques for Computing Nash Equilibria of Sequential Games.

Samid Hoda, Andrew Gilpin, Javier Peña, Tuomas Sandholm

Math. Oper. Res., 2010

Speeding up gradient-based algorithms for sequential games.

Andrew Gilpin, Tuomas Sandholm

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

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

Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 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

Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

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

Andrew Gilpin, Tuomas Sandholm

Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

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

Andrew Gilpin, Tuomas Sandholm

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

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

Andrew Gilpin, Javier Peña, Tuomas Sandholm

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007

Lossless abstraction of imperfect information games.

Andrew Gilpin, Tuomas Sandholm

J. ACM, 2007

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

Andrew Gilpin, Samid Hoda, Javier Peña, Tuomas Sandholm

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

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

Andrew Gilpin, Tuomas Sandholm

Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), 2007

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

Andrew Gilpin, Tuomas Sandholm, Troels Bjerre Sørensen

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

Finding equilibria in large sequential games of imperfect information.

Andrew Gilpin, Tuomas Sandholm

Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

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

Andrew Gilpin, Tuomas Sandholm

Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), 2006

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

Andrew Gilpin, Tuomas Sandholm

Proceedings of the Proceedings, 2006

2005

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

Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine

Manag. Sci., 2005

Mixed-Integer Programming Methods for Finding Nash Equilibria.

Tuomas Sandholm, Andrew Gilpin, Vincent Conitzer

Proceedings of the Proceedings, 2005

Optimal Rhode Island Hold'em Poker.

Andrew Gilpin, Tuomas Sandholm

Proceedings of the Proceedings, 2005

2003

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

Tuomas Sandholm, Andrew Gilpin

Proceedings of the Agent-Mediated Electronic Commerce V, 2003

2002

Winner determination in combinatorial auction generalizations.

Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine

Proceedings of the First International Joint Conference on Autonomous Agents & Multiagent Systems, 2002

2001

CABOB: A Fast Optimal Algorithm for Combinatorial Auctions.

Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine

Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001