Welcome to the homepage of Andrew Gilpin. I am best reached by e-mail: I defended my thesis on April 29, 2009.

**Interests:** Artificial intelligence, computational game
theory, equilibrium computation, linear and integer programming,
convex optimization, auctions, exchanges, mechanism design, electronic
commerce, computational finance

**Summary:** From 2002--2009 I was a graduate student in the
Computer Science Department working with Prof. Tuomas Sandholm in
the Agent-Mediated Electronic
Marketplaces Group.

**Equilibrium computation**- Andrew Gilpin, Javier Peña, and Tuomas Sandholm. 2008. First-order algorithm with O(ln
(1/ε)) convergence for ε-equilibrium in two-person
zero-sum games.
*23rd National Conference on Artificial Intelligence (*, Chicago, IL.**AAAI'08**) - Samid Hoda, Andrew Gilpin, and Javier Peña. 2008. Smoothing techniques for
computing Nash equilibria of sequential games. Available on Optimization
Online. [view abstract]
This is a substantially revised version of :
- Samid Hoda, Andrew Gilpin, and Javier Peña. 2007. A gradient-based approach for computing Nash equilibria of large sequential games. Available on Optimization Online.

- Andrew Gilpin and Tuomas Sandholm. 2008. Solving two-person zero-sum
repeated games of incomplete information.
*International Joint Conference on Autonomous Agents and Multiagent Systems (*, Estoril, Portugal. [view abstract]**AAMAS'08**) - Andrew Gilpin, Samid Hoda, Javier Peña, and Tuomas
Sandholm. 2007. Gradient-based
algorithms for finding Nash equilibria in extensive form games.
*3rd International Workshop on Internet and Network Economics (*, San Diego, CA. [view abstract]**WINE'07**) - Tuomas Sandholm, Andrew Gilpin, and Vincent Conitzer. 2005. Mixed-integer programming methods
for finding Nash equilibria.
*20th National Conference on Artificial Intelligence (*, pp. 495-501, Pittsburgh, PA. [view abstract]**AAAI'05**)

- Andrew Gilpin, Javier Peña, and Tuomas Sandholm. 2008. First-order algorithm with O(ln
(1/ε)) convergence for ε-equilibrium in two-person
zero-sum games.
**Automated abstraction of imperfect information games, poker AI**- Andrew Gilpin and Tuomas Sandholm. 2008. Expectation-based versus
potential-aware automated abstraction in imperfect information
games: An experimental comparison using poker. Short paper.
*23rd National Conference on Artificial Intelligence (*, Chicago, IL. [view abstract]**AAAI'08**) - Andrew Gilpin, Tuomas Sandholm, and Troels Bjerre
Sørensen. 2008. A
heads-up no-limit Texas Hold'em poker player: Discretized betting
models and automatically generated equilibrium-finding programs.
*International Joint Conference on Autonomous Agents and Multiagent Systems (*, Estoril, Portugal. [view abstract]**AAMAS'08**) - Andrew Gilpin and Tuomas Sandholm. 2007. Lossless abstraction of imperfect
information games.
*Journal of the ACM*, 54(5). [view abstract] Subsumes:- Andrew Gilpin and Tuomas Sandholm. 2006. Finding equilibria in large
sequential games of imperfect information.
*ACM Conference on Electronic Commerce (*, Ann Arbor, MI.**EC'06**) - Andrew Gilpin and Tuomas Sandholm. 2005. Finding equilibria in large sequential games of imperfect information. Technical Report CMU-CS-05-158, Carnegie Mellon University, Pittsburgh, PA.

- Andrew Gilpin and Tuomas Sandholm. 2006. Finding equilibria in large
sequential games of imperfect information.
- Andrew Gilpin, Tuomas Sandholm, and Troels Bjerre
Sørensen. 2007. Potential-aware automated abstraction
of sequential games, and holistic equilibrium analysis of Texas
Hold'em poker.
*22nd National Conference on Artificial Intelligence (*, Vancouver, BC, Canada. [view abstract]**AAAI'07**) - Andrew Gilpin and Tuomas Sandholm. 2007. Better automated abstraction
techniques for imperfect information games, with application to
Texas Hold'em poker.
*Sixth International Joint Conference on Autonomous Agents and Multiagent Systems (*, Honolulu, HI.**AAMAS'07**)**Finalist for Best Paper Award.**[view abstract] - Andrew Gilpin and Tuomas Sandholm. 2006. A competitive Texas Hold'em poker
player via automated abstraction and real-time equilibrium
computation.
*21st National Conference on Artificial Intelligence (*, Boston, MA. [view abstract]**AAAI'06**)

- Andrew Gilpin and Tuomas Sandholm. 2008. Expectation-based versus
potential-aware automated abstraction in imperfect information
games: An experimental comparison using poker. Short paper.
**Software demonstrations**- Andrew Gilpin, Tuomas Sandholm, and Troels Bjerre
Sørensen. 2008.
*GS3*and*Tartanian*: Game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs.*Seventh International Joint Conference on Autonomous Agents and Multiagent Systems (*, Estoril, Portugal. Demonstration Track. [view abstract]**AAMAS'08**) - Andrew Gilpin and Tuomas Sandholm. 2006. A Texas Hold'em Poker player
based on automated abstraction and real-time equilibrium
computation.
*Fifth International Joint Conference on Autonomous Agents and Multiagent Systems (*, Hakodate, Japan. Demonstration Track. [view abstract]**AAMAS'06**) - Andrew Gilpin and Tuomas Sandholm. 2005. Optimal Rhode
Island Hold'em Poker.
*20th National Conference on Artificial Intelligence (*, pp. 1684-1685, Pittsburgh, PA, 2005. Intelligent Systems Demonstration. [view abstract]**AAAI'05**)- Play against the optimal Rhode Island Hold'em Poker player

- Andrew Gilpin, Tuomas Sandholm, and Troels Bjerre
Sørensen. 2008.
**Auctions and exchanges**- Tuomas Sandholm and Andrew Gilpin. 2006. Sequences of Take-It-or-Leave-It
Offers: Near-Optimal Auctions Without Full Valuation Revelation.
*Fifth International Joint Conference on Autonomous Agents and Multiagent Systems (*, Hakodate, Japan. [view abstract]**AAMAS'06**)- Early version:
, Melbourne, Australia, 2003.**AAMAS'03**5th Workshop on Agent Mediated Electronic Commerce (**AMEC-V**)

- Early version:
- Andrew Gilpin and Tuomas Sandholm. 2004. Arbitrage in Combinatorial
Exchanges.
, New York, NY, 2004. [view abstract]**AAMAS'04**6th Workshop on Agent Mediated Electronic Commerce (**AMEC-VI**)

- Tuomas Sandholm and Andrew Gilpin. 2006. Sequences of Take-It-or-Leave-It
Offers: Near-Optimal Auctions Without Full Valuation Revelation.
**Winner determination and search**- Andrew Gilpin and Tuomas Sandholm. 2007. Information-theoretic approaches
to branching in search.
*International Joint Conference on Artificial Intelligence (*, Hyderabad, India. [view abstract]**IJCAI'07**)- Early version:
**AAMAS'06**, Hakodate, Japan.

- Early version:
- Tuomas Sandholm, Subhash Suri, Andrew Gilpin, and David
Levine. 2005. CABOB:
A Fast Optimal Algorithm for Winner Determination in Combinatorial
Auctions.
*Management Science*, Special Issue on Electronic Markets, 51(3):374--390. [view abstract]- Early version:
*International Joint Conference on Artificial Intelligence (*, Seattle, WA, 2001.**IJCAI'01**)

- Early version:
- Tuomas Sandholm, Subhash Suri, Andrew Gilpin, and David
Levine. 2002. Winner
Determination in Combinatorial Auction Generalizations.
*First International Joint Conference on Autonomous Agents and Multiagent Systems (*, pp. 69-76, Bologna, Italy. [view abstract]**AAMAS'02**)- Early version:
*AGENTS'01 Workshop on Agent-based Approaches to B2B*, pp. 35-41, Montreal, Canada, May 28th, 2001.

- Early version:

- Andrew Gilpin and Tuomas Sandholm. 2007. Information-theoretic approaches
to branching in search.

- Hot seat interview.
*Timeout Dubai*, UAE, February 1-8, 2007. - US expert to speak on computers and artificial intelligence.
*Khaleej Times*, UAE, January 18, 2007. - CMU deals a winning hand for Texas Hold 'em.
*Pittsburgh Post-Gazette*, July 19, 2006.