2026 Tuomas Sandholm: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	93	526	510	280	270	436	30861

Tuomas Sandholm publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Tuomas Sandholm sits on this spectrum.

32 publications 991+

This scientist: 436 publications — 90th percentile

90% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Tuomas Sandholm D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Tuomas Sandholm sits on this spectrum.

30 D-Index 131+

This scientist: 93 D-Index — 97th percentile

97% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Research.com Recognitions

2014 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)
2008 - Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) For significant contributions to the foundations of multiagent systems and computational game theory, pioneering work in combinatorial auctions, multiagent preference elicitation, and automated mechanism design, and principles and large-scale application of electronic marketplaces.
2008 - ACM Fellow For contributions to combinatorial auctions and mechanism design.
2003 - Fellow of Alfred P. Sloan Foundation

Overview

Tuomas Sandholm is affiliated with Carnegie Mellon University in United States. Their work spans multiple areas within computer science and decision sciences, with a significant focus on management science and operations research as well as artificial intelligence.

Their recent papers cover diverse topics primarily published between 2020 and 2024. Notable publications include:

Dynamic Matching via Weighted Myopia with Application to Kidney Exchange, 2021, Proceedings of the AAAI Conference on Artificial Intelligence
Using machine learning to improve survival prediction after heart transplantation, 2021, Journal of Cardiac Surgery
Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries, 2020, Operations Research
Optimal Auctions for Spiteful Bidders, 2021, Proceedings of the AAAI Conference on Artificial Intelligence
How Much Data Is Sufficient to Learn High-Performing Algorithms?, 2024, Journal of the ACM

The primary fields of study for their work include:

Computer Science
Decision Sciences

The subfields reflect a detailed engagement with:

Management Science and Operations Research
Artificial Intelligence
Economics and Econometrics
Computational Theory and Mathematics
Safety Research

Major topics in their research focus on:

Advanced Bandit Algorithms Research
Game Theory and Applications
Reinforcement Learning in Robotics
Artificial Intelligence in Games
Auction Theory and Applications
Machine Learning and Algorithms
Experimental Behavioral Economics Studies

Sandholm frequently collaborates with a range of co-authors, including:

Gabriele Farina
Ioannis Anagnostides
Brian Hu Zhang
Maria-Florina Balcan
Christian Kroer

Their publications are commonly found in renowned academic venues such as:

arXiv (Cornell University)
Proceedings of the AAAI Conference on Artificial Intelligence
Operations Research
Journal of the ACM
Proceedings of the 23rd ACM Conference on Economics and Computation

Throughout their career, Sandholm has received several prestigious recognitions, including:

Fellow of the Institute for Operations Research and the Management Sciences (INFORMS), 2014
Fellow of the Association for the Advancement of Artificial Intelligence (AAAI), 2008, cited for contributions to multiagent systems, combinatorial auctions, and electronic marketplaces
ACM Fellow, 2008, recognized for contributions to combinatorial auctions and mechanism design
Fellow of Alfred P. Sloan Foundation, 2003

Best Publications

Algorithm for optimal winner determination in combinatorial auctions

Tuomas Sandholm

1591
Citations
Coalition structure generation with worst case guarantees

Tuomas Sandholm;Kate Larson;Martin Andersson;Onn Shehory

1124
Citations
Distributed rational decision making

Tuomas W. Sandholm

839
Citations
An implementation of the contract net protocol based on marginal cost calculations

Tuomas Sandholm

767
Citations
eMediator: A Next Generation Electronic Commerce Server

Tuomas Sandholm

760
Citations
Coalitions among computationally bounded agents

Tuomas W. Sandholm;Victor R. Lesser

672
Citations
Superhuman AI for heads-up no-limit poker: Libratus beats top professionals

Noam Brown;Tuomas Sandholm

670
Citations
Superhuman AI for multiplayer poker

Noam Brown;Noam Brown;Tuomas Sandholm

654
Citations
Issues in automated negotiation and electronic commerce: extending the contract net framework

Tuomas Sandholm;Victor Lesser

647
Citations
Computing the optimal strategy to commit to

Vincent Conitzer;Tuomas Sandholm

561
Citations
When are elections with few candidates hard to manipulate

Vincent Conitzer;Tuomas Sandholm;Jérôme Lang

536
Citations
An algorithm for optimal winner determination in combinatorial auctions

Tuomas Sandholm

528
Citations
Multiagent reinforcement learning in the Iterated Prisoner's Dilemma

Tuomas W. Sandholm;Robert H. Crites

498
Citations
CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions

Tuomas Sandholm;Subhash Suri;Andrew Gilpin;David Levine

486
Citations
Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges

David J. Abraham;Avrim Blum;Tuomas Sandholm

415
Citations
Issues in computational Vickrey auctions

Tuomas Sandholm

359
Citations
Complexity of mechanism design

Vincent Conitzer;Tuomas Sandholm

350
Citations
BOB: improved winner determination in combinatorial auctions and generalizations

Tuomas Sandholm;Subhash Suri

338
Citations
Complexity results about Nash equilibria

Vincent Conitzer;Tüomas Sandholm

332
Citations
Winner determination in combinatorial auction generalizations

Tuomas Sandholm;Subhash Suri;Andrew Gilpin;David Levine

327
Citations

Frequent Co-Authors

Vincent Conitzer Carnegie Mellon University

Subhash Suri University of California, Santa Barbara

David C. Parkes Harvard University

Craig Boutilier Google (United States)

Maria-Florina Balcan Carnegie Mellon University

Ariel D. Procaccia Harvard University

Victor Lesser University of Massachusetts Amherst

Felix Brandt Technical University of Munich

David I. Levine University of California, Berkeley

Avrim Blum Toyota Technological Institute at Chicago

External Links

Personal website of Tuomas Sandholm Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring best college majors in the field of Computer Science is a great way to align your studies with high-demand industries and rewarding career opportunities. Many students today are also considering flexible, fully online programs to gain the skills they need while balancing other commitments.

For those interested in advancing quickly or with less time conflict, knowing what's the easiest masters degree to get can be helpful. Some programs emphasize streamlined coursework and faster completion compared to traditional full-time degrees.

Aspiring academics and professionals can benefit from affordable phd programs online, which can make advanced education more accessible and reduce student debt. Likewise, educators may be interested in the shortest online edd programs for a fast-track to educational leadership roles.

Whether your goal is tech innovation, teaching, or leadership, the right online program can open doors to new career pathways while fitting your unique needs.