Algorithm for optimal winner determination in combinatorial auctions T Sandholm Artificial Intelligence 135, 1-54, 2002 | 1586 | 2002 |
Coalition structure generation with worst case guarantees T Sandholm, K Larson, M Andersson, O Shehory, F Tohmé Artificial intelligence 111 (1-2), 209-238, 1999 | 1047 | 1999 |
Superhuman AI for multiplayer poker N Brown, T Sandholm Science 365 (6456), 885-890, 2019 | 986 | 2019 |
Superhuman AI for heads-up no-limit poker: Libratus beats top professionals N Brown, T Sandholm Science 359 (6374), 418-424, 2018 | 938 | 2018 |
Distributed rational decision making T Sandholm Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence …, 1999 | 826 | 1999 |
An implementation of the contract net protocol based on marginal cost calculations T Sandholm AAAI, 256-262, 1993 | 764 | 1993 |
Coalitions among computationally bounded agents T Sandholm, VR Lesser Artificial Intelligence 94 (1-2), 99-137, 1997 | 673 | 1997 |
Computing the optimal strategy to commit to V Conitzer, T Sandholm Proceedings of the 7th ACM Conference on Electronic Commerce (EC), 82-90, 2006 | 643 | 2006 |
Issues in automated negotiation and electronic commerce: Extending the contract net framework T Sandholm, VR Lesser ICMAS, 12-14, 1995 | 643 | 1995 |
Multiagent reinforcement learning in the iterated prisoner's dilemma T Sandholm, RH Crites Biosystems 37 (1), 147-166, 1996 | 511 | 1996 |
Clearing algorithms for barter exchange markets: Enabling nationwide kidney exchanges DJ Abraham, A Blum, T Sandholm Proceedings of the 8th ACM Conference on Electronic Commerce (EC), 295-304, 2007 | 469 | 2007 |
A nonsimultaneous, extended, altruistic-donor chain MA Rees, JE Kopke, RP Pelletier, DL Segev, ME Rutter, AJ Fabrega, ... New England Journal of Medicine 360 (11), 1096-1101, 2009 | 421 | 2009 |
When are elections with few candidates hard to manipulate? V Conitzer, T Sandholm, J Lang Journal of the ACM (JACM) 54 (3), 14-es, 2007 | 419 | 2007 |
Complexity of mechanism design V Conitzer, T Sandholm Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence …, 2002 | 411 | 2002 |
Reinforcement learning to play an optimal Nash equilibrium in team Markov games X Wang, T Sandholm Advances in neural information processing systems 15, 2002 | 393 | 2002 |
AWESOME: A general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents V Conitzer, T Sandholm Machine Learning 67 (1), 23-43, 2007 | 361 | 2007 |
eMediator: A next generation electronic commerce server T Sandholm Computational Intelligence 18 (4), 656-676, 2002 | 360 | 2002 |
Complexity results about Nash equilibria V Conitzer, T Sandholm International Joint Conference on Artificial Intelligence (IJCAI), 2003 | 332 | 2003 |
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 | 332 | 2002 |
Contract types for satisficing task allocation T Sandholm Proceedings of the AAAI spring symposium: Satisficing models, 23-25, 1998 | 313 | 1998 |