← Authors

Tuomas Sandholm

97 papers · 2004–2026 · 6 conferences · across top CS/AI conferences

Achievements

🧭 Keyword Pioneer πŸƒ Academic Marathon (21) 🐝 Cross-Pollinator (8) 🌍 Conference Polyglot (6) πŸŒ‰ Interdisciplinary Bridge 🐣 Hot Topic Early Bird πŸ—ΊοΈ Taxonomy Completionist (11) 🌈 Renaissance Researcher (6) 🏠 Conference Loyalist (32) 🀝 Dynamic Duo (39) πŸ‘‘ Triple Crown πŸ† Keyword Champion (2) πŸ† Grand Slam πŸ”¬ Deep Specialist (57) 🧬 Topic Evolution πŸ“ˆ Trend Setter πŸš€ Conference Pioneer ⚑ Prolific Year (9) πŸ—ƒοΈ Keyword Collector (247) πŸ’Ž Century Club (95) πŸ”₯ Unstoppable (13)

Conferences

NIPS (32) IJCAI (23) AAAI (21) ICML (14) ICLR (6) JMLR (1)

Top co-authors

Gabriele Farina (39) Christian Kroer (17) Ioannis Anagnostides (14) Brian Hu Zhang (10) Siddharth Prasad (9) Noam Brown (9) Ellen Vitercik (8) Maria-Florina Balcan (8) Nicola Gatti (7) Brian Zhang (6)

Keywords

extensive-form game (36) game theory (34) nash equilibrium (26) counterfactual regret minimization (12) zero-sum game (11) multi-agent system (11) regret minimization (11) correlated equilibrium (9) mechanism design (8) counterfactual regret (7) equilibrium computation (7) combinatorial optimization (7) learning theory (6) sample complexity (6) revenue optimization (5) integer programming (5) imperfect information game (5) online learning (5) imperfect-information game (5) equilibrium refinement (5)

Papers

Faster Game Solving via Hyperparameter Schedules AAAI 2026
Weakest Bidder Types and New Core-Selecting Combinatorial Auctions AAAI 2026
New Sequence-Independent Lifting Techniques for Cover Inequalities and When They Induce Facets IJCAI 2025
Joint-Perturbation Simultaneous Pseudo-Gradient IJCAI 2025
Expected Variational Inequalities ICML 2025
The Value of Recall in Extensive-Form Games AAAI 2025
Computing Game Symmetries and Equilibria That Respect Them AAAI 2025
A Multiagent Path Search Algorithm for Large-Scale Coalition Structure Generation AAAI 2025
Increasing Revenue in Efficient Combinatorial Auctions by Learning to Generate Artificial Competition AAAI 2025
Exponential Lower Bounds on the Double Oracle Algorithm in Zero-Sum Games IJCAI 2024
Game-Theoretic Robust Reinforcement Learning Handles Temporally-Coupled Perturbations ICLR 2024
Model-Free Preference Elicitation IJCAI 2024
Toward Optimal Policy Population Growth in Two-Player Zero-Sum Games ICLR 2024
Imperfect-Recall Games: Equilibrium Concepts and Their Complexity IJCAI 2024
Faster Optimal Coalition Structure Generation via Offline Coalition Selection and Graph-Based Search IJCAI 2024
Scalable Mechanism Design for Multi-Agent Path Finding IJCAI 2024
Efficient $\Phi$-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games NIPS 2024
Convergence of $\text{log}(1/\epsilon)$ for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis NIPS 2024
Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property AAAI 2024
Automated Design of Affine Maximizer Mechanisms in Dynamic Settings AAAI 2024
On the Outcome Equivalence of Extensive-Form and Behavioral Correlated Equilibria AAAI 2024
Confronting Reward Model Overoptimization with Constrained RLHF ICLR 2024
Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Sequential Games ICLR 2024
Differentiable Economics for Randomized Affine Maximizer Auctions IJCAI 2023
Team Belief DAG: Generalizing the Sequence Form to Team Games for Fast Computation of Correlated Team Max-Min Equilibria via Regret Minimization ICML 2023
Near-Optimal $Ξ¦$-Regret Learning in Extensive-Form Games ICML 2023
On the Convergence of No-Regret Learning Dynamics in Time-Varying Games NIPS 2023
Bicriteria Multidimensional Mechanism Design with Side Information NIPS 2023
Team-PSRO for Learning Approximate TMECor in Large Team Games via Cooperative Reinforcement Learning NIPS 2023
On the Interplay between Social Welfare and Tractability of Equilibria NIPS 2023
Finding Mixed-Strategy Equilibria of Continuous-Action Games without Gradients Using Randomized Policy Networks IJCAI 2023
Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games NIPS 2023
Optimal Anytime Coalition Structure Generation Utilizing Compact Solution Space Representation IJCAI 2023
Meta-Learning in Games ICLR 2023
ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret ICLR 2023
Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts NIPS 2022
Near-Optimal No-Regret Learning Dynamics for General Convex Games NIPS 2022
On Last-Iterate Convergence Beyond Zero-Sum Games ICML 2022
Fast Payoff Matrix Sparsification Techniques for Structured Extensive-Form Games AAAI 2022
Team Correlated Equilibria in Zero-Sum Extensive-Form Games via Tree Decompositions AAAI 2022
Maximizing Revenue under Market Shrinkage and Market Uncertainty NIPS 2022
Uncoupled Learning Dynamics with $O(\log T)$ Swap Regret in Multiplayer Games NIPS 2022
Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games NIPS 2022
Polynomial-Time Optimal Equilibria with a Mediator in Extensive-Form Games NIPS 2022
Subgame Solving in Adversarial Team Games NIPS 2022
Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond NIPS 2021
Learning Within an Instance for Designing High-Revenue Combinatorial Auctions IJCAI 2021
Connecting Optimal Ex-Ante Collusion in Teams to Extensive-Form Correlation: Faster Algorithms and Positive Complexity Results ICML 2021
Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games AAAI 2021
Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games AAAI 2021
Finding and Certifying (Near-)Optimal Strategies in Black-Box Extensive-Form Games AAAI 2021
Generalization in Portfolio-Based Algorithm Selection AAAI 2021
Equilibrium Refinement for the Age of Machines: The One-Sided Quasi-Perfect Equilibrium NIPS 2021
Subgame solving without common knowledge NIPS 2021
Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent AAAI 2021
Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees AAAI 2020
Improving Policy-Constrained Kidney Exchange via Pre-Screening NIPS 2020
Small Nash Equilibrium Certificates in Very Large Games NIPS 2020
Polynomial-Time Computation of Optimal Correlated Equilibria in Two-Player Extensive-Form Games with Public Chance Moves and Beyond NIPS 2020
Coarse Correlation in Extensive-Form Games AAAI 2020
Refined bounds for algorithm configuration: The knife-edge of dual class approximability ICML 2020
Stochastic Regret Minimization in Extensive-Form Games ICML 2020
Sparsified Linear Programming for Zero-Sum Equilibrium Finding ICML 2020
Efficient Algorithms for Learning Revenue-Maximizing Two-Part Tariffs IJCAI 2020
Quasi-Perfect Stackelberg Equilibrium AAAI 2019
Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games AAAI 2019
Solving Imperfect-Information Games via Discounted Regret Minimization AAAI 2019
Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions NIPS 2019
Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium NIPS 2019
Deep Counterfactual Regret Minimization ICML 2019
Regret Circuits: Composability of Regret Minimizers ICML 2019
Stable-Predictive Optimistic Counterfactual Regret Minimization ICML 2019
Correlation in Extensive-Form Games: Saddle-Point Formulation and Benchmarks NIPS 2019
Trembling-Hand Perfection in Extensive-Form Games with Commitment IJCAI 2018
Depth-Limited Solving for Imperfect-Information Games NIPS 2018
A Unified Framework for Extensive-Form Game Abstraction with Bounds NIPS 2018
Ex ante coordination and collusion in zero-sum multi-player extensive-form games NIPS 2018
Solving Large Sequential Games with the Excessive Gap Technique NIPS 2018
Practical exact algorithm for trembling-hand equilibrium refinements in games NIPS 2018
Learning to Branch ICML 2018
Safe and Nested Subgame Solving for Imperfect-Information Games NIPS 2017
Regret Minimization in Behaviorally-Constrained Zero-Sum Games ICML 2017
Reduced Space and Faster Convergence in Imperfect-Information Games via Pruning ICML 2017
Super-Human AI for Strategic Reasoning: Beating Top Pros in Heads-Up No-Limit Texas Hold'em IJCAI 2017
Operation Frames and Clubs in Kidney Exchange IJCAI 2017
Smoothing Method for Approximate Extensive-Form Perfect Equilibrium IJCAI 2017
Libratus: The Superhuman AI for No-Limit Poker IJCAI 2017
Sequential Planning for Steering Immune System Adaptation IJCAI 2016
Sample Complexity of Automated Mechanism Design NIPS 2016
Scalable Segment Abstraction Method for Advertising Campaign Admission and Inventory Allocation Optimization IJCAI 2016
Limited Lookahead in Imperfect-Information Games IJCAI 2015
Simultaneous Abstraction and Equilibrium Finding in Games IJCAI 2015
Regret-Based Pruning in Extensive-Form Games NIPS 2015
Diverse Randomized Agents Vote to Win NIPS 2014
Analysis and Optimization of Multi-Dimensional Percentile Mechanisms IJCAI 2013
Action Translation in Extensive-Form Games with Large Action Spaces: Axioms, Paradoxes, and the Pseudo-Harmonic Mapping IJCAI 2013
Preference Elicitation and Query Learning JMLR 2004