Tuomas Sandholm
Angel Jordan University Professor of Computer Science
Studies AI for strategic reasoning, including game solving, mechanism design and market optimization.
Tuomas Sandholm's lab at CMU works on learning theory & optimization, reasoning & neuro-symbolic AI and reasoning & agents. 55 papers since 2023, 50 at top venues, mostly IJCAI and AAAI. 4 PhD students. 43 alumni. Applications close .
At a glance
- papers, 2023–2026
- 14/ year
- at T1 venues
- 91%
- PhD students
- 4
- MS students
- 0
- alumni listed
- 43
Papers by yearfrom DBLP, 2023–2026
- 9 papers2026 · T1 7 · collecting
- 14 papers2025 · T1 12
- 20 papers2024 · T1 19
- 12 papers2023 · T1 12
T1 venuesOtherVenues: IJCAI, AAAI, ICLR, NeurIPS, AAMAS
Research focuspaper titles that use each topic's words
- Learning theory & optimization15 papers
- mechanism2 papers
- mechanism design2 papers
- Reasoning & agents1 paper
- Reasoning & neuro-symbolic AI0 papers
Paper list
From DBLP.
20269 papers
- ICLR (T1)Convergence of Regret Matching in Potential Games and Constrained Optimization (opens in a new tab)
- Artificial Intelligence (T1)Efficient representations for team and imperfect-recall equilibrium computation (opens in a new tab)
- IJCAI/ECAIEquilibrium Refinements Improve Subgame Solving in Imperfect-Information Games (opens in a new tab)
- AAAI (T1)Faster Game Solving via Hyperparameter Schedules (opens in a new tab)
- ICLR (T1)General search techniques without common knowledge for imperfect-information games, and application to superhuman Fog of War chess (opens in a new tab)
- AAMAS (T1)Incremental Multiple Oracle (opens in a new tab)
- ICLR (T1)Learning a Game by Paying the Agents (opens in a new tab)
- Math. Oper. Res.Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation (opens in a new tab)
- AAAI (T1)Weakest Bidder Types and New Core-Selecting Combinatorial Auctions (opens in a new tab)
202514 papers
- AAAI (T1)A Multiagent Path Search Algorithm for Large-Scale Coalition Structure Generation (opens in a new tab)
- AAMAS (T1)AlphaZeroES: Direct Score Maximization Outperforms Planning Loss Minimization (opens in a new tab)
- AAMAS (T1)ApproxED: Approximate Exploitability Descent via Learned Best Responses (opens in a new tab)
- Oper. Res.Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria (opens in a new tab)
- STOC (T1)Computational Lower Bounds for No-Regret Learning in Normal-Form Games (opens in a new tab)
- AAAI (T1)Computing Game Symmetries and Equilibria That Respect Them (opens in a new tab)
- ICML (T1)Expected Variational Inequalities (opens in a new tab)
- Oper. Res.Generalization Guarantees for Multi-Item Profit Maximization: Pricing, Auctions, and Randomized Mechanisms (opens in a new tab)
- AAAI (T1)Increasing Revenue in Efficient Combinatorial Auctions by Learning to Generate Artificial Competition (opens in a new tab)
- IJCAI (T1)Joint-Perturbation Simultaneous Pseudo-Gradient (opens in a new tab)
- EC (T1)Learning and Computation of Φ-Equilibria at the Frontier of Tractability (opens in a new tab)
- IJCAI (T1)New Sequence-Independent Lifting Techniques for Cover Inequalities and When They Induce Facets (opens in a new tab)
202420 papers
- AAAI (T1)Automated Design of Affine Maximizer Mechanisms in Dynamic Settings (opens in a new tab)
- ICLR (T1)Confronting Reward Model Overoptimization with Constrained RLHF (opens in a new tab)
- NeurIPS (T1)Convergence of $\text{log}(1/\epsilon)$ for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis (opens in a new tab)
- NeurIPS (T1)Efficient $\Phi$-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games (opens in a new tab)
- AAMAS (T1)Efficient Size-based Hybrid Algorithm for Optimal Coalition Structure Generation (opens in a new tab)
- IJCAI (T1)Exponential Lower Bounds on the Double Oracle Algorithm in Zero-Sum Games (opens in a new tab)
- IJCAI (T1)Faster Optimal Coalition Structure Generation via Offline Coalition Selection and Graph-Based Search (opens in a new tab)
- ICLR (T1)Game-Theoretic Robust Reinforcement Learning Handles Temporally-Coupled Perturbations (opens in a new tab)
- EC (T1)Hidden-Role Games: Equilibrium Concepts and Computation (opens in a new tab)
- Journal of the ACM (T1)How Much Data Is Sufficient to Learn High-Performing Algorithms? (opens in a new tab)
- IJCAI (T1)Imperfect-Recall Games: Equilibrium Concepts and Their Complexity (opens in a new tab)
- Journal of the ACM (T1)Learning to Branch: Generalization Guarantees and Limits of Data-Independent Discretization (opens in a new tab)
202312 papers
- NeurIPS (T1)Bicriteria Multidimensional Mechanism Design with Side Information (opens in a new tab)
- NeurIPS (T1)Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games (opens in a new tab)
- IJCAI (T1)Differentiable Economics for Randomized Affine Maximizer Auctions (opens in a new tab)
- ICLR (T1)ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret (opens in a new tab)
- IJCAI (T1)Finding Mixed-Strategy Equilibria of Continuous-Action Games without Gradients Using Randomized Policy Networks (opens in a new tab)
- ICLR (T1)Meta-Learning in Games (opens in a new tab)
- ICML (T1)Near-Optimal Φ-Regret Learning in Extensive-Form Games (opens in a new tab)
- NeurIPS (T1)On the Convergence of No-Regret Learning Dynamics in Time-Varying Games (opens in a new tab)
- NeurIPS (T1)On the Interplay between Social Welfare and Tractability of Equilibria (opens in a new tab)
- IJCAI (T1)Optimal Anytime Coalition Structure Generation Utilizing Compact Solution Space Representation (opens in a new tab)
- ICML (T1)Team Belief DAG: Generalizing the Sequence Form to Team Games for Fast Computation of Correlated Team Max-Min Equilibria via Regret Minimization (opens in a new tab)
- NeurIPS (T1)Team-PSRO for Learning Approximate TMECor in Large Team Games via Cooperative Reinforcement Learning (opens in a new tab)
Where alumni went43 listed, 0% to industry
Industry 0Academia 2
Also to
- Bar-Ilan University
- Tsinghua University
Apply to CMUFall 2027
CMU SCS Computer Science PhD
- Round
- Single round
- Opens
- GRE
- See program page
- English
- TOEFL / IELTS / Duolingo (F-1/J-1 non-native speakers)
- Fee
- USD 100 (USD 80 by early deadline)
Confirmed on the program page.
Similar labsnearest by research summary
- GBImperial
Danilo Mandic
- Learning theory & optimization
- USUCLA
Quanquan Gu
- Learning theory & optimization
- USUW
Radha Poovendran
- Trustworthy & safe ML
- CNSJTU
Shaobo Cui
- Probabilistic & causal inference
- SGNTU
Kezhi Mao
- Trustworthy & safe ML
- USUSC
Sai Praneeth Karimireddy
- Learning theory & optimization
Your notes
Save this lab to keep notes.
Data
Checked against the lab homepage.
- Collected
- Verified
- Papers
- DBLP
- Members
- Lab homepage
- Alumni
- Lab homepage
Tiers are venue classifications, not lab rankings.
CMUcloses