The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrew Gilpin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andrew Gilpin, Tuomas Sandholm
    Optimal Rhode Island Hold'em Poker. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:1684-1685 [Conf]
  2. Andrew Gilpin, Tuomas Sandholm
    A Competitive Texas Hold'em Poker Player via Automated Abstraction and Real-Time Equilibrium Computation. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  3. Tuomas Sandholm, Andrew Gilpin, Vincent Conitzer
    Mixed-Integer Programming Methods for Finding Nash Equilibria. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:495-501 [Conf]
  4. Tuomas Sandholm, Andrew Gilpin
    Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation. [Citation Graph (0, 0)][DBLP]
    AMEC, 2003, pp:73-91 [Conf]
  5. Andrew Gilpin, Tuomas Sandholm
    Information-theoretic approaches to branching in search. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2006, pp:545-547 [Conf]
  6. Andrew Gilpin, Tuomas Sandholm
    A Texas Hold'em poker player based on automated abstraction and real-time equilibrium computation. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2006, pp:1453-1454 [Conf]
  7. Tuomas Sandholm, Andrew Gilpin
    Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2006, pp:1127-1134 [Conf]
  8. Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine
    Winner determination in combinatorial auction generalizations. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2002, pp:69-76 [Conf]
  9. Tuomas Sandholm, Andrew Gilpin
    Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation. [Citation Graph (0, 0)][DBLP]
    Computing and Markets, 2005, pp:- [Conf]
  10. Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine
    CABOB: A Fast Optimal Algorithm for Combinatorial Auctions. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:1102-1108 [Conf]
  11. Andrew Gilpin, Tuomas Sandholm
    Information-Theoretic Approaches to Branching in Search. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:2286-2292 [Conf]
  12. Andrew Gilpin, Tuomas Sandholm
    Finding equilibria in large sequential games of imperfect information. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2006, pp:160-169 [Conf]
  13. Andrew Gilpin, Tuomas Sandholm, Troels Bjerre Sørensen
    Potential-Aware Automated Abstraction of Sequential Games, and Holistic Equilibrium Analysis of Texas Hold'em Poker. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:50-57 [Conf]
  14. Andrew Gilpin, Tuomas Sandholm
    Lossless abstraction of imperfect information games. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2007, v:54, n:5, pp:- [Journal]

  15. First-Order Algorithm with O(ln(1/e)) Convergence for e-Equilibrium in Two-Person Zero-Sum Games. [Citation Graph (, )][DBLP]


  16. Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker. [Citation Graph (, )][DBLP]


  17. Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker. [Citation Graph (, )][DBLP]


  18. A heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding programs. [Citation Graph (, )][DBLP]


  19. Solving two-person zero-sum repeated games of incomplete information. [Citation Graph (, )][DBLP]


  20. GS3 and Tartanian: game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs. [Citation Graph (, )][DBLP]


  21. Speeding up gradient-based algorithms for sequential games. [Citation Graph (, )][DBLP]


  22. Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002