| 2026 | AAAI | Weakest Bidder Types and New Core-Selecting Combinatorial Auctions. | Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm |
| 2026 | AAAI | Faster Game Solving via Hyperparameter Schedules. | Naifeng Zhang, Stephen Marcus McAleer, Tuomas Sandholm |
| 2025 | AAAI | Increasing Revenue in Efficient Combinatorial Auctions by Learning to Generate Artificial Competition. | Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm |
| 2025 | AAAI | The Value of Recall in Extensive-Form Games. | Ratip Emin Berker, Emanuel Tewolde, Ioannis Anagnostides, Tuomas Sandholm, Vincent Conitzer |
| 2025 | AAAI | A Multiagent Path Search Algorithm for Large-Scale Coalition Structure Generation. | Redha Taguelmimt, Samir Aknine, Djamila Boukredera, Narayan Changder, Tuomas Sandholm |
| 2025 | AAAI | Computing Game Symmetries and Equilibria That Respect Them. | Emanuel Tewolde, Brian Hu Zhang, Caspar Oesterheld, Tuomas Sandholm, Vincent Conitzer |
| 2025 | ICML | Expected Variational Inequalities. | Brian Hu Zhang, Ioannis Anagnostides, Emanuel Tewolde, Ratip Emin Berker, Gabriele Farina, Vincent Conitzer, Tuomas Sandholm |
| 2025 | IJCAI | Joint-Perturbation Simultaneous Pseudo-Gradient. | Carlos Martin, Tuomas Sandholm |
| 2025 | IJCAI | New Sequence-Independent Lifting Techniques for Cover Inequalities and When They Induce Facets. | Siddharth Prasad, Ellen Vitercik, Maria-Florina Balcan, Tuomas Sandholm |
| 2025 | STOC | Computational Lower Bounds for No-Regret Learning in Normal-Form Games. | Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm |
| 2024 | AAAI | Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property. | Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm |
| 2024 | AAAI | Automated Design of Affine Maximizer Mechanisms in Dynamic Settings. | Michael J. Curry, Vinzenz Thoma, Darshan Chakrabarti, Stephen McAleer, Christian Kroer, Tuomas Sandholm, Niao He, Sven Seuken |
| 2024 | AAAI | On the Outcome Equivalence of Extensive-Form and Behavioral Correlated Equilibria. | Brian Hu Zhang, Tuomas Sandholm |
| 2024 | ICLR | Game-Theoretic Robust Reinforcement Learning Handles Temporally-Coupled Perturbations. | Yongyuan Liang, Yanchao Sun, Ruijie Zheng, Xiangyu Liu, Benjamin Eysenbach, Tuomas Sandholm, Furong Huang, Stephen Marcus McAleer |
| 2024 | ICLR | Toward Optimal Policy Population Growth in Two-Player Zero-Sum Games. | Stephen Marcus McAleer, JB Lanier, Kevin A. Wang, Pierre Baldi, Tuomas Sandholm, Roy Fox |
| 2024 | ICLR | Confronting Reward Model Overoptimization with Constrained RLHF. | Ted Moskovitz, Aaditya K. Singh, DJ Strouse, Tuomas Sandholm, Ruslan Salakhutdinov, Anca D. Dragan, Stephen Marcus McAleer |
| 2024 | ICLR | Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Sequential Games. | Brian Hu Zhang, Gabriele Farina, Tuomas Sandholm |
| 2024 | IJCAI | Scalable Mechanism Design for Multi-Agent Path Finding. | Paul Friedrich, Yulun Zhang, Michael J. Curry, Ludwig Dierks, Stephen McAleer, Jiaoyang Li, Tuomas Sandholm, Sven Seuken |
| 2024 | IJCAI | Model-Free Preference Elicitation. | Carlos Martin, Craig Boutilier, Ofer Meshi, Tuomas Sandholm |
| 2024 | IJCAI | Faster Optimal Coalition Structure Generation via Offline Coalition Selection and Graph-Based Search. | Redha Taguelmimt, Samir Aknine, Djamila Boukredera, Narayan Changder, Tuomas Sandholm |
| 2024 | IJCAI | Imperfect-Recall Games: Equilibrium Concepts and Their Complexity. | Emanuel Tewolde, Brian Hu Zhang, Caspar Oesterheld, Manolis Zampetakis, Tuomas Sandholm, Paul Goldberg, Vincent Conitzer |
| 2024 | IJCAI | Exponential Lower Bounds on the Double Oracle Algorithm in Zero-Sum Games. | Brian Hu Zhang, Tuomas Sandholm |
| 2023 | ICLR | Meta-Learning in Games. | Keegan Harris, Ioannis Anagnostides, Gabriele Farina, Mikhail Khodak, Steven Wu, Tuomas Sandholm |
| 2023 | ICLR | ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret. | Stephen Marcus McAleer, Gabriele Farina, Marc Lanctot, Tuomas Sandholm |
| 2023 | ICML | Near-Optimal Φ-Regret Learning in Extensive-Form Games. | Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm |
| 2023 | ICML | Team Belief DAG: Generalizing the Sequence Form to Team Games for Fast Computation of Correlated Team Max-Min Equilibria via Regret Minimization. | Brian Hu Zhang, Gabriele Farina, Tuomas Sandholm |
| 2023 | IJCAI | Differentiable Economics for Randomized Affine Maximizer Auctions. | Michael J. Curry, Tuomas Sandholm, John P. Dickerson |
| 2023 | IJCAI | Finding Mixed-Strategy Equilibria of Continuous-Action Games without Gradients Using Randomized Policy Networks. | Carlos Martin, Tuomas Sandholm |
| 2023 | IJCAI | Optimal Anytime Coalition Structure Generation Utilizing Compact Solution Space Representation. | Redha Taguelmimt, Samir Aknine, Djamila Boukredera, Narayan Changder, Tuomas Sandholm |
| 2022 | AAAI | Fast Payoff Matrix Sparsification Techniques for Structured Extensive-Form Games. | Gabriele Farina, Tuomas Sandholm |
| 2022 | AAAI | Team Correlated Equilibria in Zero-Sum Extensive-Form Games via Tree Decompositions. | Brian Hu Zhang, Tuomas Sandholm |
| 2022 | CP | Improved Sample Complexity Bounds for Branch-And-Cut. | Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik |
| 2022 | ICML | On Last-Iterate Convergence Beyond Zero-Sum Games. | Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm |
| 2022 | STOC | Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games. | Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, Tuomas Sandholm |
| 2021 | AAAI | Generalization in Portfolio-Based Algorithm Selection. | Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik |
| 2021 | AAAI | Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent. | Gabriele Farina, Christian Kroer, Tuomas Sandholm |
| 2021 | AAAI | Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games. | Gabriele Farina, Tuomas Sandholm |
| 2021 | AAAI | Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games. | Gabriele Farina, Robin Schmucker, Tuomas Sandholm |
| 2021 | AAAI | Finding and Certifying (Near-)Optimal Strategies in Black-Box Extensive-Form Games. | Brian Hu Zhang, Tuomas Sandholm |
| 2021 | ICML | Connecting Optimal Ex-Ante Collusion in Teams to Extensive-Form Correlation: Faster Algorithms and Positive Complexity Results. | Gabriele Farina, Andrea Celli, Nicola Gatti, Tuomas Sandholm |
| 2021 | IJCAI | Learning Within an Instance for Designing High-Revenue Combinatorial Auctions. | Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm |
| 2021 | STOC | How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm design. | Maria-Florina Balcan, Dan F. DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, Ellen Vitercik |
| 2020 | AAAI | Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees. | Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik |
| 2020 | AAAI | Coarse Correlation in Extensive-Form Games. | Gabriele Farina, Tommaso Bianchi, Tuomas Sandholm |
| 2020 | ICML | Refined bounds for algorithm configuration: The knife-edge of dual class approximability. | Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik |
| 2020 | ICML | Stochastic Regret Minimization in Extensive-Form Games. | Gabriele Farina, Christian Kroer, Tuomas Sandholm |
| 2020 | ICML | Sparsified Linear Programming for Zero-Sum Equilibrium Finding. | Brian Hu Zhang, Tuomas Sandholm |
| 2020 | IJCAI | Efficient Algorithms for Learning Revenue-Maximizing Two-Part Tariffs. | Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm |
| 2019 | AAAI | Solving Imperfect-Information Games via Discounted Regret Minimization. | Noam Brown, Tuomas Sandholm |
| 2019 | AAAI | Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games. | Gabriele Farina, Christian Kroer, Tuomas Sandholm |
| 2019 | AAAI | Quasi-Perfect Stackelberg Equilibrium. | Alberto Marchesi, Gabriele Farina, Christian Kroer, Nicola Gatti, Tuomas Sandholm |
| 2019 | EC | Estimating Approximate Incentive Compatibility. | Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik |
| 2019 | ICML | Deep Counterfactual Regret Minimization. | Noam Brown, Adam Lerer, Sam Gross, Tuomas Sandholm |
| 2019 | ICML | Stable-Predictive Optimistic Counterfactual Regret Minimization. | Gabriele Farina, Christian Kroer, Noam Brown, Tuomas Sandholm |
| 2019 | ICML | Regret Circuits: Composability of Regret Minimizers. | Gabriele Farina, Christian Kroer, Tuomas Sandholm |
| 2018 | AAAI | Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead. | Christian Kroer, Gabriele Farina, Tuomas Sandholm |
| 2018 | AAAI | Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead. | Christian Kroer, Gabriele Farina, Tuomas Sandholm |
| 2018 | ICML | Learning to Branch. | Maria-Florina Balcan, Travis Dick, Tuomas Sandholm, Ellen Vitercik |
| 2018 | IJCAI | Trembling-Hand Perfection in Extensive-Form Games with Commitment. | Gabriele Farina, Alberto Marchesi, Christian Kroer, Nicola Gatti, Tuomas Sandholm |
| 2017 | AAAI | Exclusion Method for Finding Nash Equilibrium in Multiplayer Games. | Kimmo Berg, Tuomas Sandholm |
| 2017 | AAAI | Dynamic Thresholding and Pruning for Regret Minimization. | Noam Brown, Christian Kroer, Tuomas Sandholm |
| 2017 | AAAI | Reduced Space and Faster Convergence in Imperfect-Information Games via Regret-Based Pruning. | Noam Brown, Tuomas Sandholm |
| 2017 | AAAI | Safe and Nested Endgame Solving for Imperfect-Information Games. | Noam Brown, Tuomas Sandholm |
| 2017 | AAAI | Small Representations of Big Kidney Exchange Graphs. | John P. Dickerson, Aleksandr M. Kazachkov, Ariel D. Procaccia, Tuomas Sandholm |
| 2017 | AAAI | Small Representations of Big Kidney Exchange Graphs. | John P. Dickerson, Aleksandr M. Kazachkov, Ariel D. Procaccia, Tuomas Sandholm |
| 2017 | AAAI | Inter-Club Kidney Exchange. | Gabriele Farina, John P. Dickerson, Tuomas Sandholm |
| 2017 | ICML | Reduced Space and Faster Convergence in Imperfect-Information Games via Pruning. | Noam Brown, Tuomas Sandholm |
| 2017 | ICML | Regret Minimization in Behaviorally-Constrained Zero-Sum Games. | Gabriele Farina, Christian Kroer, Tuomas Sandholm |
| 2017 | IJCAI | Libratus: The Superhuman AI for No-Limit Poker. | Noam Brown, Tuomas Sandholm |
| 2017 | IJCAI | Operation Frames and Clubs in Kidney Exchange. | Gabriele Farina, John P. Dickerson, Tuomas Sandholm |
| 2017 | IJCAI | Smoothing Method for Approximate Extensive-Form Perfect Equilibrium. | Christian Kroer, Gabriele Farina, Tuomas Sandholm |
| 2017 | IJCAI | Super-Human AI for Strategic Reasoning: Beating Top Pros in Heads-Up No-Limit Texas Hold'em. | Tuomas Sandholm |
| 2016 | AAAI | Strategy-Based Warm Starting for Regret Minimization in Games. | Noam Brown, Tuomas Sandholm |
| 2016 | AAAI | Fast Optimal Clearing of Capped-Chain Barter Exchanges. | Benjamin Plaut, John P. Dickerson, Tuomas Sandholm |
| 2016 | IJCAI | Baby Tartanian8: Winning Agent from the 2016 Annual Computer Poker Competition. | Noam Brown, Tuomas Sandholm |
| 2016 | IJCAI | Sequential Planning for Steering Immune System Adaptation. | Christian Kroer, Tuomas Sandholm |
| 2016 | IJCAI | Scalable Segment Abstraction Method for Advertising Campaign Admission and Inventory Allocation Optimization. | Fei Peng, Tuomas Sandholm |
| 2015 | AAAI | Tartanian7: A Champion Two-Player No-Limit Texas Hold'em Poker-Playing Program. | Noam Brown, Sam Ganzfried, Tuomas Sandholm |
| 2015 | AAAI | Hierarchical Abstraction, Distributed Equilibrium Computation, and Post-Processing, with Application to a Champion No-Limit Texas Hold'em Agent. | Noam Brown, Sam Ganzfried, Tuomas Sandholm |
| 2015 | AAAI | FutureMatch: Combining Human Value Judgments and Machine Learning to Match in Dynamic Environments. | John P. Dickerson, Tuomas Sandholm |
| 2015 | AAAI | Endgame Solving in Large Imperfect-Information Games. | Sam Ganzfried, Tuomas Sandholm |
| 2015 | AAAI | Strategy-Proof and Efficient Kidney Exchange Using a Credit Mechanism. | Chen Hajaj, John P. Dickerson, Avinatan Hassidim, Tuomas Sandholm, David Sarne |
| 2015 | AAAI | Steering Evolution Strategically: Computational Game Theory and Opponent Exploitation for Treatment Planning, Drug Design, and Synthetic Biology. | Tuomas Sandholm |
| 2015 | AAAI | Abstraction for Solving Large Incomplete-Information Games. | Tuomas Sandholm |
| 2015 | IJCAI | Simultaneous Abstraction and Equilibrium Finding in Games. | Noam Brown, Tuomas Sandholm |
| 2015 | IJCAI | Limited Lookahead in Imperfect-Information Games. | Christian Kroer, Tuomas Sandholm |
| 2014 | AAAI | Regret Transfer and Parameter Optimization. | Noam Brown, Tuomas Sandholm |
| 2014 | AAAI | The Computational Rise and Fall of Fairness. | John P. Dickerson, Jonathan R. Goldman, Jeremy Karp, Ariel D. Procaccia, Tuomas Sandholm |
| 2014 | AAAI | Multi-Organ Exchange: The Whole Is Greater than the Sum of its Parts. | John P. Dickerson, Tuomas Sandholm |
| 2014 | AAAI | Balancing Efficiency and Fairness in Dynamic Kidney Exchange. | John Paul Dickerson, Tuomas Sandholm |
| 2014 | AAAI | Potential-Aware Imperfect-Recall Abstraction with Earth Mover's Distance in Imperfect-Information Games. | Sam Ganzfried, Tuomas Sandholm |
| 2013 | AAAI | Throwing Darts: Random Sampling Helps Tree Search when the Number of Short Certificates is Moderate. | John Paul Dickerson, Tuomas Sandholm |
| 2013 | AAAI | Algorithms for Strong Nash Equilibrium with More than Two Agents. | Nicola Gatti, Marco Rocco, Tuomas Sandholm |
| 2013 | AAAI | Strong Nash Equilibrium Is in Smoothed P. | Nicola Gatti, Marco Rocco, Tuomas Sandholm |
| 2013 | IJCAI | Action Translation in Extensive-Form Games with Large Action Spaces: Axioms, Paradoxes, and the Pseudo-Harmonic Mapping. | Sam Ganzfried, Tuomas Sandholm |
| 2013 | IJCAI | Analysis and Optimization of Multi-Dimensional Percentile Mechanisms. | Xin Sui, Craig Boutilier, Tuomas Sandholm |
| 2013 | SoCS | Throwing Darts: Random Sampling Helps Tree Search when the Number of Short Certificates Is Moderate. | John Paul Dickerson, Tuomas Sandholm |
| 2012 | AAAI | Dynamic Matching via Weighted Myopia with Application to Kidney Exchange. | John P. Dickerson, Ariel D. Procaccia, Tuomas Sandholm |
| 2012 | AAAI | Optimal Auctions for Spiteful Bidders. | Pingzhong Tang, Tuomas Sandholm |
| 2012 | AAMAS | Optimizing kidney exchange with transplant chains: theory and reality. | John P. Dickerson, Ariel D. Procaccia, Tuomas Sandholm |
| 2012 | AAMAS | Strategy purification and thresholding: effective non-equilibrium approaches for playing large games. | Sam Ganzfried, Tuomas Sandholm, Kevin Waugh |
| 2012 | AAMAS | Rational market making with probabilistic knowledge. | Abraham Othman, Tuomas Sandholm |
| 2012 | AAMAS | Mixed-bundling auctions with reserve prices. | Pingzhong Tang, Tuomas Sandholm |
| 2012 | IAAI | TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems. | Zhengyu Yin, Albert Xin Jiang, Matthew Paul Johnson, Christopher Kiekintveld, Kevin Leyton-Brown, Tuomas Sandholm, Milind Tambe, John P. Sullivan |
| 2012 | UAI | Combining local search techniques and path following for bimatrix games. | Nicola Gatti, Giorgio Patrini, Marco Rocco, Tuomas Sandholm |
| 2011 | AAAI | Strategy Purification. | Sam Ganzfried, Tuomas Sandholm, Kevin Waugh |
| 2011 | IJCAI | Approximating Optimal Combinatorial Auctions for Complements Using Restricted Welfare Maximization. | Pingzhong Tang, Tuomas Sandholm |
| 2010 | AAAI | Envy Quotes and the Iterated Core-Selecting Combinatorial Auction. | Abraham Othman, Tuomas Sandholm |
| 2010 | AAAI | Asymmetric Spite in Auctions. | Ankit Sharma, Tuomas Sandholm |
| 2010 | AAAI | Automated Channel Abstraction for Advertising Auctions. | William E. Walsh, Craig Boutilier, Tuomas Sandholm, Rob Shields, George L. Nemhauser, David C. Parkes |
| 2009 | IJCAI | Online Stochastic Optimization in the Large: Application to Kidney Exchange. | Pranjal Awasthi, Tuomas Sandholm |
| 2009 | IJCAI | Methodology for Designing Reasonably Expressive Mechanisms with Application to Ad Auctions. | Michael Benisch, Norman M. Sadeh, Tuomas Sandholm |
| 2009 | IJCAI | Computing Equilibria in Multiplayer Stochastic Games of Imperfect Information. | Sam Ganzfried, Tuomas Sandholm |
| 2009 | IJCAI | How Pervasive Is the Myerson-Satterthwaite Impossibility? | Abraham Othman, Tuomas Sandholm |
| 2009 | SAGT | Better with Byzantine: Manipulation-Optimal Mechanisms. | Abraham Othman, Tuomas Sandholm |
| 2009 | SOUPS | The impact of expressiveness on the effectiveness of privacy mechanisms for location-sharing. | Michael Benisch, Patrick Gage Kelley, Norman M. Sadeh, Tuomas Sandholm, Janice Y. Tsai, Lorrie Faith Cranor, Paul Hankes Drielsma |
| 2008 | AAAI | A Theory of Expressiveness in Mechanisms. | Michael Benisch, Norman M. Sadeh, Tuomas Sandholm |
| 2008 | AAAI | Expressive Banner Ad Auctions and Model-Based Online Optimization for Clearing. | Craig Boutilier, David C. Parkes, Tuomas Sandholm, William E. Walsh |
| 2008 | AAAI | First-Order Algorithm with O(ln(1/e)) Convergence for e-Equilibrium in Two-Person Zero-Sum Games. | Andrew Gilpin, Javier Pea, Tuomas Sandholm |
| 2008 | AAAI | Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker. | Andrew Gilpin, Tuomas Sandholm |
| 2008 | AAAI | Computing Reserve Prices and Identifying the Value Distribution in Real-world Auctions with Market Disruptions. | William E. Walsh, David C. Parkes, Tuomas Sandholm, Craig Boutilier |
| 2007 | AAAI | Potential-Aware Automated Abstraction of Sequential Games, and Holistic Equilibrium Analysis of Texas Hold'em Poker. | Andrew Gilpin, Tuomas Sandholm, Troels Bjerre Srensen |
| 2007 | AAAI | Automated Online Mechanism Design and Prophet Inequalities. | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tuomas Sandholm |
| 2007 | AAIM | Expressive Commerce and Its Application to Sourcing: How We Conducted $25 Billion of Generalized Combinatorial Auctions. | Tuomas Sandholm |
| 2007 | IJCAI | Spiteful Bidding in Sealed-Bid Auctions. | Felix Brandt, Tuomas Sandholm, Yoav Shoham |
| 2007 | IJCAI | Incremental Mechanism Design. | Vincent Conitzer, Tuomas Sandholm |
| 2007 | IJCAI | Information-Theoretic Approaches to Branching in Search. | Andrew Gilpin, Tuomas Sandholm |
| 2007 | IJCAI | Automated Design of Multistage Mechanisms. | Tuomas Sandholm, Vincent Conitzer, Craig Boutilier |
| 2006 | AAAI | Algorithms for Rationalizability and CURB Sets. | Michael Benisch, George B. Davis, Tuomas Sandholm |
| 2006 | AAAI | Nonexistence of Voting Rules That Are Usually Hard to Manipulate. | Vincent Conitzer, Tuomas Sandholm |
| 2006 | AAAI | A Competitive Texas Hold'em Poker Player via Automated Abstraction and Real-Time Equilibrium Computation. | Andrew Gilpin, Tuomas Sandholm |
| 2006 | AAAI | A Compact Representation Scheme for Coalitional Games in Open Anonymous Environments. | Naoki Ohta, Atsushi Iwasaki, Makoto Yokoo, Kohki Maruono, Vincent Conitzer, Tuomas Sandholm |
| 2006 | AAAI | Expressive Commerce and Its Application to Sourcing. | Tuomas Sandholm |
| 2005 | AAAI | Expressive Negotiation in Settings with Externalities. | Vincent Conitzer, Tuomas Sandholm |
| 2005 | AAAI | A Generalized Strategy Eliminability Criterion and Computational Methods for Applying It. | Vincent Conitzer, Tuomas Sandholm |
| 2005 | AAAI | Combinatorial Auctions with | Vincent Conitzer, Tuomas Sandholm, Paolo Santi |
| 2005 | AAAI | Optimal Rhode Island Hold'em Poker. | Andrew Gilpin, Tuomas Sandholm |
| 2005 | AAAI | Approximating Revenue-Maximizing Combinatorial Auctions. | Anton Likhodedov, Tuomas Sandholm |
| 2005 | AAAI | Mixed-Integer Programming Methods for Finding Nash Equilibria. | Tuomas Sandholm, Andrew Gilpin, Vincent Conitzer |
| 2005 | AAAI | Coalitional Games in Open Anonymous Environments. | Makoto Yokoo, Vincent Conitzer, Tuomas Sandholm, Naoki Ohta, Atsushi Iwasaki |
| 2005 | FC | Efficient Privacy-Preserving Protocols for Multi-unit Auctions. | Felix Brandt, Tuomas Sandholm |
| 2005 | IJCAI | On Correctness and Privacy in Distributed Mechanisms. | Felix Brandt, Tuomas Sandholm |
| 2005 | IJCAI | Coalitional Games in Open Anonymous Environments. | Makoto Yokoo, Vincent Conitzer, Tuomas Sandholm, Naoki Ohta, Atsushi Iwasaki |
| 2005 | UAI | Common Voting Rules as Maximum Likelihood Estimators. | Vincent Conitzer, Tuomas Sandholm |
| 2005 | TARK | Unconditional privacy in social choice. | Felix Brandt, Tuomas Sandholm |
| 2004 | AAAI | Eliciting Bid Taker Non-price Preferences in (Combinatorial) Auctions. | Craig Boutilier, Tuomas Sandholm, Rob Shields |
| 2004 | AAAI | Combinatorial Auctions with Structured Item Graphs. | Vincent Conitzer, Jonathan Derryberry, Tuomas Sandholm |
| 2004 | AAAI | Computing Shapley Values, Manipulating Value Division Schemes, and Checking Core Membership in Multi-Issue Domains. | Vincent Conitzer, Tuomas Sandholm |
| 2004 | AAAI | Using Performance Profile Trees to Improve Deliberation Control. | Kate Larson, Tuomas Sandholm |
| 2004 | AAAI | Methods for Boosting Revenue in Combinatorial Auctions. | Anton Likhodedov, Tuomas Sandholm |
| 2004 | COLT | Towards a Characterization of Polynomial Preference Elicitation with Value Queries in Combinatorial Auctions (Extended Abstract). | Paolo Santi, Vincent Conitzer, Tuomas Sandholm |
| 2004 | ICML | Communication complexity as a lower bound for learning in games. | Vincent Conitzer, Tuomas Sandholm |
| 2003 | COLT | Preference Elicitation and Query Learning. | Avrim Blum, Jeffrey C. Jackson, Tuomas Sandholm, Martin Zinkevich |
| 2003 | CP | Automated Mechanism Design: A New Application Area for Search Algorithms. | Tuomas Sandholm |
| 2003 | CP | Terminating Decision Algorithms Optimally. | Tuomas Sandholm |
| 2003 | ICML | AWESOME: A General Multiagent Learning Algorithm that Converges in Self-Play and Learns a Best Response Against Stationary Opponents. | Vincent Conitzer, Tuomas Sandholm |
| 2003 | ICML | BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games. | Vincent Conitzer, Tuomas Sandholm |
| 2003 | IJCAI | Complexity of Determining Nonemptiness of the Core. | Vincent Conitzer, Tuomas Sandholm |
| 2003 | IJCAI | Complexity Results about Nash Equilibria. | Vincent Conitzer, Tuomas Sandholm |
| 2003 | IJCAI | Universal Voting Protocol Tweaks to Make Manipulation Hard. | Vincent Conitzer, Tuomas Sandholm |
| 2003 | IJCAI | Definition and Complexity of Some Basic Metareasoning Problems. | Vincent Conitzer, Tuomas Sandholm |
| 2003 | IJCAI | Making Markets and Democracy Work: A Story of Incentives and Computing. | Tuomas Sandholm |
| 2003 | TARK | How many candidates are needed to make elections hard to manipulate? | Vincent Conitzer, Jrme Lang, Tuomas Sandholm |
| 2002 | AAAI | Partial-Revelation VCG Mechanism for Combinatorial Auctions. | Wolfram Conen, Tuomas Sandholm |
| 2002 | AAAI | Complexity of Manipulating Elections with Few Candidates. | Vincent Conitzer, Tuomas Sandholm |
| 2002 | AAAI | Vote Elicitation: Complexity and Strategy-Proofness. | Vincent Conitzer, Tuomas Sandholm |
| 2002 | AAAI | (Im)possibility of Safe Exchange Mechanism Design. | Tuomas Sandholm, Xiao Feng Wang |
| 2002 | ISAAC | Market Clearing with Supply and Demand Curves. | Tuomas Sandholm, Subhash Suri |
| 2002 | SODA | Online algorithms for market clearing. | Avrim Blum, Tuomas Sandholm, Martin Zinkevich |
| 2002 | UAI | Complexity of Mechanism Design. | Vincent Conitzer, Tuomas Sandholm |
| 2001 | IJCAI | Market Clearability. | Tuomas Sandholm, Subhash Suri |
| 2001 | IJCAI | CABOB: A Fast Optimal Algorithm for Combinatorial Auctions. | Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine |
| 2000 | AAAI | Deliberation in Equilibrium: Bargaining in Computationally Complex Problems. | Kate Larson, Tuomas Sandholm |
| 2000 | AAAI | Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations. | Tuomas Sandholm, Subhash Suri |
| 2000 | ICDCS | Contract Type Sequencing for Reallocative Negotiation. | Martin Andersson, Tuomas Sandholm |
| 1999 | AAAI | Time-Quality Tradeoffs in Reallocative Negotiation with Combinatorial Contract Types. | Martin Andersson, Tuomas Sandholm |
| 1999 | AAAI | Power, Dependence and Stability in Multiagent Plans. | Sviatoslav B. Brainov, Tuomas Sandholm |
| 1999 | AAAI | eMediator: a Next Generation Electronic Commerce Server. | Tuomas Sandholm |
| 1999 | AAAI | Bargaining with Deadlines. | Tuomas Sandholm, Nir Vulkan |
| 1999 | IJCAI | An Algorithm for Optimal Winner Determination in Combinatorial Auctions. | Tuomas Sandholm |
| 1999 | IJCAI | Algorithms for Optimizing Leveled Commitment Contracts. | Tuomas Sandholm, Sandeep Sikka, Samphel Norden |
| 1998 | AAAI | Leveled Commitment Contracts with Myopic and Strategic Agents. | Martin Andersson, Tuomas Sandholm |
| 1998 | AAAI | Anytime Coalition Structure Generation with Worst Case Guarantees. | Tuomas Sandholm, Kate Larson, Martin Andersson, Onn Shehory, Fernando Tohm |
| 1997 | IJCAI | On the Gains and Losses of Speculation in Equilibrium Markets. | Tuomas Sandholm, Fredrik Ygge |
| 1996 | AAAI | A Second Order Parameter for 3SAT. | Tuomas Sandholm |
| 1996 | AAAI | Advantages of a Leveled Commitment Contracting Protocol. | Tuomas Sandholm, Victor R. Lesser |
| 1995 | IJCAI | On Multiagent Q-Learning in a Semi-Competitive Domain. | Tuomas Sandholm, Robert H. Crites |
| 1995 | IJCAI | Coalition Formation among Bounded Rational Agents. | Tuomas Sandholm, Victor R. Lesser |
| 1995 | IJCAI | Equilibrium Analysis of the Possibilities of Unenforced Exchange in Multiagent Systems. | Tuomas Sandholm, Victor R. Lesser |
| 1994 | AAAI | Exploiting Meta-Level information in a Distributed Scheduling System. | Daniel E. Neiman, David W. Hildum, Victor R. Lesser, Tuomas Sandholm |
| 1993 | AAAI | An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations. | Tuomas Sandholm |