Tuomas Sandholm

ORCID

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 205

Top Venues

Publications

Brian Hu Zhang, Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm
Efficient Φ-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games. CoRR (2024)
Michael J. Curry, Vinzenz Thoma, Darshan Chakrabarti, Stephen McAleer, Christian Kroer, Tuomas Sandholm, Niao He, Sven Seuken
Automated Design of Affine Maximizer Mechanisms in Dynamic Settings. AAAI (2024)
Redha Taguelmimt, Samir Aknine, Djamila Boukredera, Narayan Changder, Tuomas Sandholm
Efficient Size-based Hybrid Algorithm for Optimal Coalition Structure Generation. AAMAS (2024)
Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, Manolis Zampetakis
On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games. ITCS (2024)
Redha Taguelmimt, Samir Aknine, Djamila Boukredera, Narayan Changder, Tuomas Sandholm
A Multiagent Path Search Algorithm for Large-Scale Coalition Structure Generation. AAMAS (2024)
Naifeng Zhang, Stephen McAleer, Tuomas Sandholm
Faster Game Solving via Hyperparameter Schedules. CoRR (2024)
Michael J. Curry, Vinzenz Thoma, Darshan Chakrabarti, Stephen McAleer, Christian Kroer, Tuomas Sandholm, Niao He, Sven Seuken
Automated Design of Affine Maximizer Mechanisms in Dynamic Settings. CoRR (2024)
Redha Taguelmimt, Samir Aknine, Djamila Boukredera, Narayan Changder, Tuomas Sandholm
Faster Optimal Coalition Structure Generation via Offline Coalition Selection and Graph-Based Search. CoRR (2024)
Stephen Marcus McAleer, JB Lanier, Kevin A. Wang, Pierre Baldi, Tuomas Sandholm, Roy Fox
Toward Optimal Policy Population Growth in Two-Player Zero-Sum Games. ICLR (2024)
Constantinos Daskalakis, Gabriele Farina, Noah Golowich, Tuomas Sandholm, Brian Hu Zhang
A Lower Bound on Swap Regret in Extensive-Form Games. CoRR (2024)
Carlos Martin, Tuomas Sandholm
AlphaZeroES: Direct score maximization outperforms planning loss minimization. CoRR (2024)
Maria-Florina Balcan, Travis Dick, Tuomas Sandholm, Ellen Vitercik
Learning to Branch: Generalization Guarantees and Limits of Data-Independent Discretization. J. ACM 71 (2) (2024)
Ted Moskovitz, Aaditya K. Singh, DJ Strouse, Tuomas Sandholm, Ruslan Salakhutdinov, Anca D. Dragan, Stephen Marcus McAleer
Confronting Reward Model Overoptimization with Constrained RLHF. ICLR (2024)
Brian Hu Zhang, Tuomas Sandholm
On the Outcome Equivalence of Extensive-Form and Behavioral Correlated Equilibria. CoRR (2024)
Brian Hu Zhang, Tuomas Sandholm
On the Outcome Equivalence of Extensive-Form and Behavioral Correlated Equilibria. AAAI (2024)
Paul Friedrich, Yulun Zhang, Michael Curry, Ludwig Dierks, Stephen McAleer, Jiaoyang Li, Tuomas Sandholm, Sven Seuken
Scalable Mechanism Design for Multi-Agent Path Finding. CoRR (2024)
Brian Hu Zhang, Tuomas Sandholm
Exponential Lower Bounds on the Double Oracle Algorithm in Zero-Sum Games. CoRR (2024)
Carlos Martin, Tuomas Sandholm
Simultaneous incremental support adjustment and metagame solving: An equilibrium-finding framework for continuous-action games. CoRR (2024)
Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property. AAAI (2024)
Brian Hu Zhang, Gabriele Farina, Tuomas Sandholm
Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Sequential Games. ICLR (2024)
Siddharth Prasad, Ellen Vitercik, Maria-Florina Balcan, Tuomas Sandholm
New Sequence-Independent Lifting Techniques for Cutting Planes and When They Induce Facets. CoRR (2024)
Yongyuan Liang, Yanchao Sun, Ruijie Zheng, Xiangyu Liu, Benjamin Eysenbach, Tuomas Sandholm, Furong Huang, Stephen Marcus McAleer
Game-Theoretic Robust Reinforcement Learning Handles Temporally-Coupled Perturbations. ICLR (2024)
Emanuel Tewolde, Brian Hu Zhang, Caspar Oesterheld, Manolis Zampetakis, Tuomas Sandholm, Paul W. Goldberg, Vincent Conitzer
Imperfect-Recall Games: Equilibrium Concepts and Their Complexity. CoRR (2024)
Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm
Near-Optimal Φ-Regret Learning in Extensive-Form Games. ICML (2023)
Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, Manolis Zampetakis
On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games. CoRR (2023)
Carlos Martin, Tuomas Sandholm
Finding Mixed-Strategy Equilibria of Continuous-Action Games without Gradients Using Randomized Policy Networks. IJCAI (2023)
Brian Hu Zhang, Gabriele Farina, Tuomas Sandholm
Team Belief DAG: Generalizing the Sequence Form to Team Games for Fast Computation of Correlated Team Max-Min Equilibria via Regret Minimization. ICML (2023)
Ioannis Anagnostides, Tuomas Sandholm
On the Interplay between Social Welfare and Tractability of Equilibria. CoRR (2023)
Ioannis Anagnostides, Tuomas Sandholm
On the Interplay between Social Welfare and Tractability of Equilibria. NeurIPS (2023)
Michael J. Curry, Tuomas Sandholm, John P. Dickerson
Differentiable Economics for Randomized Affine Maximizer Auctions. IJCAI (2023)
Ted Moskovitz, Aaditya K. Singh, DJ Strouse, Tuomas Sandholm, Ruslan Salakhutdinov, Anca D. Dragan, Stephen McAleer
Confronting Reward Model Overoptimization with Constrained RLHF. CoRR (2023)
Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm
Bicriteria Multidimensional Mechanism Design with Side Information. NeurIPS (2023)
Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
On the Convergence of No-Regret Learning Dynamics in Time-Varying Games. NeurIPS (2023)
Luca Carminati, Brian Hu Zhang, Gabriele Farina, Nicola Gatti, Tuomas Sandholm
Hidden-Role Games: Equilibrium Concepts and Computation. CoRR (2023)
Brian Hu Zhang, Gabriele Farina, Tuomas Sandholm
Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Extensive-Form Games. CoRR (2023)
Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence Beyond the Minty Property. CoRR (2023)
Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
On the Convergence of No-Regret Learning Dynamics in Time-Varying Games. CoRR (2023)
Keegan Harris, Ioannis Anagnostides, Gabriele Farina, Mikhail Khodak, Steven Wu, Tuomas Sandholm
Meta-Learning in Games. ICLR (2023)
Yongyuan Liang, Yanchao Sun, Ruijie Zheng, Xiangyu Liu, Tuomas Sandholm, Furong Huang, Stephen McAleer
Game-Theoretic Robust Reinforcement Learning Handles Temporally-Coupled Perturbations. CoRR (2023)
Carlos Martin, Tuomas Sandholm
Planning in the imagination: High-level planning on learned abstract search spaces. CoRR (2023)
Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen Marcus McAleer, Andreas Alexander Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm
Steering No-Regret Learners to Optimal Equilibria. CoRR (2023)
Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen Marcus McAleer, Andreas Alexander Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm
Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games. CoRR (2023)
Stephen Marcus McAleer, Gabriele Farina, Marc Lanctot, Tuomas Sandholm
ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret. ICLR (2023)
Stephen McAleer, Gabriele Farina, Gaoyue Zhou, Mingzhi Wang, Yaodong Yang, Tuomas Sandholm
Team-PSRO for Learning Approximate TMECor in Large Team Games via Cooperative Reinforcement Learning. NeurIPS (2023)
Carlos Martin, Tuomas Sandholm
Computing equilibria by minimizing exploitability with best-response ensembles. CoRR (2023)
Redha Taguelmimt, Samir Aknine, Djamila Boukredera, Narayan Changder, Tuomas Sandholm
Optimal Anytime Coalition Structure Generation Utilizing Compact Solution Space Representation. IJCAI (2023)
Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen McAleer, Andreas A. Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm
Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games. NeurIPS (2023)
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm
Bicriteria Multidimensional Mechanism Design with Side Information. CoRR (2023)
Maria-Florina F. Balcan, Siddharth Prasad, Tuomas Sandholm
Maximizing Revenue under Market Shrinkage and Market Uncertainty. NeurIPS (2022)
Gabriele Farina, Ioannis Anagnostides, Haipeng Luo, Chung-Wei Lee, Christian Kroer, Tuomas Sandholm
Near-Optimal No-Regret Learning Dynamics for General Convex Games. NeurIPS (2022)
Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Chung-Wei Lee, Haipeng Luo, Tuomas Sandholm
Uncoupled Learning Dynamics with O(log T) Swap Regret in Multiplayer Games. CoRR (2022)
Brian Hu Zhang, Gabriele Farina, Andrea Celli, Tuomas Sandholm
Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation. EC (2022)
Stephen McAleer, John B. Lanier, Kevin A. Wang, Pierre Baldi, Roy Fox, Tuomas Sandholm
Self-Play PSRO: Toward Optimal Populations in Two-Player Zero-Sum Games. CoRR (2022)
Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Chung-Wei Lee, Haipeng Luo, Tuomas Sandholm
Swap Regret in Multiplayer Games. NeurIPS (2022)
Carlos Martin, Tuomas Sandholm
Finding mixed-strategy equilibria of continuous-action games without gradients using randomized policy networks. CoRR (2022)
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik
Improved Sample Complexity Bounds for Branch-And-Cut. CP (2022)
Stephen McAleer, Kevin Wang, John B. Lanier, Marc Lanctot, Pierre Baldi, Tuomas Sandholm, Roy Fox
Anytime PSRO for Two-Player Zero-Sum Games. CoRR (2022)
Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Andrea Celli, Tuomas Sandholm
Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria. EC (2022)
Stephen McAleer, Gabriele Farina, Marc Lanctot, Tuomas Sandholm
ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret. CoRR (2022)
Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
On Last-Iterate Convergence Beyond Zero-Sum Games. ICML (2022)
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik
Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts. NeurIPS (2022)
Gabriele Farina, Ioannis Anagnostides, Haipeng Luo, Chung-Wei Lee, Christian Kroer, Tuomas Sandholm
Near-Optimal No-Regret Learning for General Convex Games. CoRR (2022)
Brian Hu Zhang, Tuomas Sandholm
Polynomial-Time Optimal Equilibria with a Mediator in Extensive-Form Games. NeurIPS (2022)
Ioannis Anagnostides, Gabriele Farina, Ioannis Panageas, Tuomas Sandholm
Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games. NeurIPS (2022)
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik
Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts. CoRR (2022)
Ioannis Anagnostides, Gabriele Farina, Ioannis Panageas, Tuomas Sandholm
Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games. CoRR (2022)
Keegan Harris, Ioannis Anagnostides, Gabriele Farina, Mikhail Khodak, Zhiwei Steven Wu, Tuomas Sandholm
Meta-Learning in Games. CoRR (2022)
Brian Hu Zhang, Luca Carminati, Federico Cacciamani, Gabriele Farina, Pierriccardo Olivieri, Nicola Gatti, Tuomas Sandholm
Subgame Solving in Adversarial Team Games. NeurIPS (2022)
Brian Hu Zhang, Tuomas Sandholm
Polynomial-Time Optimal Equilibria with a Mediator in Extensive-Form Games. CoRR (2022)
Brian Hu Zhang, Tuomas Sandholm
Team Correlated Equilibria in Zero-Sum Extensive-Form Games via Tree Decompositions. AAAI (2022)
Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, Tuomas Sandholm
Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games. STOC (2022)
Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
On Last-Iterate Convergence Beyond Zero-Sum Games. CoRR (2022)
Michael J. Curry, Tuomas Sandholm, John P. Dickerson
Differentiable Economics for Randomized Affine Maximizer Auctions. CoRR (2022)
Brian Hu Zhang, Gabriele Farina, Andrea Celli, Tuomas Sandholm
Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation. CoRR (2022)
Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm
Near-Optimal $Φ$-Regret Learning in Extensive-Form Games. CoRR (2022)
Brian Hu Zhang, Gabriele Farina, Tuomas Sandholm
Team Belief DAG Form: A Concise Representation for Team-Correlated Game-Theoretic Decision Making. CoRR (2022)
Gabriele Farina, Tuomas Sandholm
Fast Payoff Matrix Sparsification Techniques for Structured Extensive-Form Games. AAAI (2022)
Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Andrea Celli, Tuomas Sandholm
Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria. CoRR (2022)
Gabriele Farina, Tuomas Sandholm
Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games. CoRR (2021)
Gabriele Farina, Christian Kroer, Tuomas Sandholm
Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria. EC (2021)
Gabriele Farina, Robin Schmucker, Tuomas Sandholm
Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games. AAAI (2021)
Gabriele Farina, Robin Schmucker, Tuomas Sandholm
Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games. CoRR (2021)
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik
Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond. CoRR (2021)
Robin Schmucker, Gabriele Farina, James R. Faeder, Fabian Fröhlich, Ali Sinan Saglam, Tuomas Sandholm
Combination treatment optimization using a pan-cancer pathway model. PLoS Comput. Biol. 17 (12) (2021)
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm
Learning Within an Instance for Designing High-Revenue Combinatorial Auctions. IJCAI (2021)
Gabriele Farina, Christian Kroer, Tuomas Sandholm
Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent. AAAI (2021)
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik
Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond. NeurIPS (2021)
Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, Tuomas Sandholm
Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games. CoRR (2021)
Brian Hu Zhang, Tuomas Sandholm
Subgame solving without common knowledge. NeurIPS (2021)
Gabriele Farina, Tuomas Sandholm
Equilibrium Refinement for the Age of Machines: The One-Sided Quasi-Perfect Equilibrium. NeurIPS (2021)
Maria-Florina Balcan, Dan F. DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, Ellen Vitercik
How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm design. STOC (2021)
Gabriele Farina, Andrea Celli, Nicola Gatti, Tuomas Sandholm
Connecting Optimal Ex-Ante Collusion in Teams to Extensive-Form Correlation: Faster Algorithms and Positive Complexity Results. ICML (2021)
Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik
Generalization in Portfolio-Based Algorithm Selection. AAAI (2021)
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik
Improved Learning Bounds for Branch-and-Cut. CoRR (2021)
Gabriele Farina, Andrea Celli, Tuomas Sandholm
Efficient Decentralized Learning Dynamics for Extensive-Form Coarse Correlated Equilibrium: No Expensive Computation of Stationary Distributions Required. CoRR (2021)
Gabriele Farina, Tuomas Sandholm
Fast Payoff Matrix Sparsification Techniques for Structured Extensive-Form Games. CoRR (2021)
Brian Hu Zhang, Tuomas Sandholm
Finding and Certifying (Near-)Optimal Strategies in Black-Box Extensive-Form Games. AAAI (2021)
Gabriele Farina, Tuomas Sandholm
Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games. AAAI (2021)
Gabriele Farina, Christian Kroer, Tuomas Sandholm
Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria. CoRR (2021)
Brian Hu Zhang, Tuomas Sandholm
Subgame solving without common knowledge. CoRR (2021)

Tuomas Sandholm.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Tuomas Sandholm