| Winner determination in combinatorial auction generalizations T Sandholm, S Suri, A Gilpin, D Levine Proceedings of the first international joint conference on Autonomous agents …, 2002 | 335 | 2002 |
| CABOB: A fast optimal algorithm for winner determination in combinatorial auctions T Sandholm, S Suri, A Gilpin, D Levine Management Science 51 (3), 374-390, 2005 | 303 | 2005 |
| CABOB: A fast optimal algorithm for combinatorial auctions T Sandholm, S Suri, A Gilpin, D Levine International Joint Conference on Artificial Intelligence 17 (1), 1102-1108, 2001 | 252 | 2001 |
| Mixed-integer programming methods for finding Nash equilibria T Sandholm, A Gilpin, V Conitzer AAAI, 495-501, 2005 | 218 | 2005 |
| Smoothing techniques for computing Nash equilibria of sequential games S Hoda, A Gilpin, J Pena, T Sandholm Mathematics of Operations Research 35 (2), 494-512, 2010 | 200 | 2010 |
| A Texas Hold'em poker player based on automated abstraction and real-time equilibrium computation A Gilpin, T Sandholm Proceedings of the fifth international joint conference on Autonomous agents …, 2006 | 160 | 2006 |
| Lossless abstraction of imperfect information games A Gilpin, T Sandholm Journal of the ACM (JACM) 54 (5), 25-es, 2007 | 159 | 2007 |
| Potential-aware automated abstraction of sequential games, and holistic equilibrium analysis of Texas Hold'em poker A Gilpin, T Sandholm, TB Sørensen Proceedings of the National Conference on Artificial Intelligence 22 (1), 50, 2007 | 123 | 2007 |
| Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker A Gilpin, T Sandholm Proceedings of the 6th international joint conference on Autonomous agents …, 2007 | 116 | 2007 |
| A heads-up no-limit Texas Hold'em poker player: Discretized betting models and automatically generated equilibrium-finding programs A Gilpin, T Sandholm, TB Sørensen Proceedings of the 7th international joint conference on Autonomous agents …, 2008 | 101 | 2008 |
| Gradient-based algorithms for finding Nash equilibria in extensive form games A Gilpin, S Hoda, J Pena, T Sandholm International Workshop on Web and Internet Economics, 57-69, 2007 | 89 | 2007 |
| First-order algorithm with convergence for-equilibrium in two-person zero-sum games A Gilpin, J Pena, T Sandholm Mathematical programming 133 (1), 279-298, 2012 | 83 | 2012 |
| Sequences of take-it-or-leave-it offers: Near-optimal auctions without full valuation revelation T Sandholm, A Gilpin Proceedings of the fifth international joint conference on Autonomous agents …, 2006 | 79 | 2006 |
| Finding equilibria in large sequential games of imperfect information A Gilpin, T Sandholm Proceedings of the 7th ACM conference on Electronic commerce, 160-169, 2006 | 56 | 2006 |
| Information-theoretic approaches to branching in search A Gilpin, T Sandholm Proceedings of the fifth international joint conference on Autonomous agents …, 2006 | 53 | 2006 |
| Combinatorial auction branch on bid searching method and apparatus T Sandholm, S Suri, DL Levine, AG Gilpin US Patent 7,640,189, 2009 | 32 | 2009 |
| Optimal rhode island hold'em poker A Gilpin, T Sandholm Proceedings of the national conference on artificial intelligence 20 (4), 1684, 2005 | 30 | 2005 |
| Algorithms for abstracting and solving imperfect information games A Gilpin Carnegie Mellon University, 2009 | 29 | 2009 |
| Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker. A Gilpin, T Sandholm AAAI, 1454-1457, 2008 | 27 | 2008 |
| Solving two-person zero-sum repeated games of incomplete information A Gilpin, T Sandholm Proceedings of the 7th international joint conference on Autonomous agents …, 2008 | 27 | 2008 |
Tuomas SandholmAngel Jordan University Professor of Computer Science, Carnegie Mellon UniversityΗ διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα cs.cmu.edu