| Algorithm for optimal winner determination in combinatorial auctions T Sandholm Artificial Intelligence 135, 1-54, 2002 | 1463 | 2002 |
| Coalition structure generation with worst case guarantees T Sandholm, K Larson, M Andersson, O Shehory, F Tohmé Artificial intelligence 111 (1), 209-238, 1999 | 893 | 1999 |
| Distributed rational decision making T Sandholm Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence …, 1999 | 785* | 1999 |
| An implementation of the contract net protocol based on marginal cost calculations T Sandholm AAAI, 256-262, 1993 | 730 | 1993 |
| Coalitions among computationally bounded agents T Sandholm, VR Lesser Artificial Intelligence 94 (1-2), 99-137, 1997 | 628 | 1997 |
| Issues in automated negotiation and electronic commerce: Extending the contract net framework T Sandholm, VR Lesser ICMAS, 12-14, 1995 | 605 | 1995 |
| 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 | 491* | 2005 |
| New complexity results about Nash equilibria V Conitzer, T Sandholm Games and Economic Behavior 63 (2), 621-641, 2008 | 484* | 2008 |
| Computing the optimal strategy to commit to V Conitzer, T Sandholm Proceedings of the 7th ACM Conference on Electronic Commerce (EC), 82-90, 2006 | 437 | 2006 |
| Multiagent reinforcement learning in the iterated prisoner's dilemma T Sandholm, RH Crites Biosystems 37 (1), 147-166, 1996 | 416 | 1996 |
| 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 | 378 | 2007 |
| Issues in computational Vickrey auctions T Sandholm International Journal of Electronic Commerce, 107-129, 2000 | 371* | 2000 |
| Leveled commitment contracts and strategic breach T Sandholm, VR Lesser Games and Economic Behavior 35 (1), 212-270, 2001 | 368* | 2001 |
| eMediator: A Next Generation Electronic Commerce Server T Sandholm Computational Intelligence 18 (4), 656-676, 2002 | 351 | 2002 |
| BOB: Improved winner determination in combinatorial auctions and generalizations T Sandholm, S Suri Artificial Intelligence 145 (1), 33-58, 2003 | 349* | 2003 |
| 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 | 341 | 2009 |
| 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 | 333 | 2007 |
| Complexity of mechanism design V Conitzer, T Sandholm Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence …, 2002 | 306 | 2002 |
| 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 | 298 | 2002 |
| Contract types for satisficing task allocation T Sandholm Proceedings of the AAAI spring symposium: Satisficing models, 23-25, 1998 | 295 | 1998 |
