Sandholm, Tuomas

198 publications

AAAI 2025 A Multiagent Path Search Algorithm for Large-Scale Coalition Structure Generation Redha Taguelmimt, Samir Aknine, Djamila Boukredera, Narayan Changder, Tuomas Sandholm

AAAI 2025 Computing Game Symmetries and Equilibria That Respect Them Emanuel Tewolde, Brian Hu Zhang, Caspar Oesterheld, Tuomas Sandholm, Vincent Conitzer

ICML 2025 Expected Variational Inequalities Brian Hu Zhang, Ioannis Anagnostides, Emanuel Tewolde, Ratip Emin Berker, Gabriele Farina, Vincent Conitzer, Tuomas Sandholm

AAAI 2025 Increasing Revenue in Efficient Combinatorial Auctions by Learning to Generate Artificial Competition Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm

IJCAI 2025 Joint-Perturbation Simultaneous Pseudo-Gradient Carlos Martin, Tuomas Sandholm

IJCAI 2025 New Sequence-Independent Lifting Techniques for Cover Inequalities and When They Induce Facets Siddharth Prasad, Ellen Vitercik, Maria-Florina Balcan, Tuomas Sandholm

NeurIPS 2025 The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games Ioannis Anagnostides, Ioannis Panageas, Tuomas Sandholm, Jingming Yan

AAAI 2025 The Value of Recall in Extensive-Form Games Ratip Emin Berker, Emanuel Tewolde, Ioannis Anagnostides, Tuomas Sandholm, Vincent Conitzer

AAAI 2024 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

ICLR 2024 Confronting Reward Model Overoptimization with Constrained RLHF Ted Moskovitz, Aaditya K Singh, Dj Strouse, Tuomas Sandholm, Ruslan Salakhutdinov, Anca Dragan, Stephen Marcus McAleer

NeurIPS 2024 Convergence of $\text{log}(1/\epsilon)$ for Gradient-Based Algorithms in Zero-Sum Games Without the Condition Number: A Smoothed Analysis Ioannis Anagnostides, Tuomas Sandholm

NeurIPS 2024 Efficient $\Phi$-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games Brian Hu Zhang, Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm

IJCAI 2024 Exponential Lower Bounds on the Double Oracle Algorithm in Zero-Sum Games Brian Hu Zhang, Tuomas Sandholm

IJCAI 2024 Faster Optimal Coalition Structure Generation via Offline Coalition Selection and Graph-Based Search Redha Taguelmimt, Samir Aknine, Djamila Boukredera, Narayan Changder, Tuomas Sandholm

ICLR 2024 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

IJCAI 2024 Imperfect-Recall Games: Equilibrium Concepts and Their Complexity Emanuel Tewolde, Brian Hu Zhang, Caspar Oesterheld, Manolis Zampetakis, Tuomas Sandholm, Paul Goldberg, Vincent Conitzer

ICLR 2024 Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Sequential Games Brian Hu Zhang, Gabriele Farina, Tuomas Sandholm

IJCAI 2024 Model-Free Preference Elicitation Carlos Martin, Craig Boutilier, Ofer Meshi, Tuomas Sandholm

AAAI 2024 On the Outcome Equivalence of Extensive-Form and Behavioral Correlated Equilibria Brian Hu Zhang, Tuomas Sandholm

AAAI 2024 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

IJCAI 2024 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

ICLR 2024 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

NeurIPS 2023 Bicriteria Multidimensional Mechanism Design with Side Information Siddharth Prasad, Maria-Florina F Balcan, Tuomas Sandholm

NeurIPS 2023 Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games Brian Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen McAleer, Andreas Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm

NeurIPSW 2023 Confronting Reward Model Overoptimization with Constrained RLHF Ted Moskovitz, Aaditya Singh, Dj Strouse, Tuomas Sandholm, Ruslan Salakhutdinov, Anca Dragan, Stephen McAleer

IJCAI 2023 Differentiable Economics for Randomized Affine Maximizer Auctions Michael J. Curry, Tuomas Sandholm, John P. Dickerson

ICLR 2023 ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret Stephen Marcus McAleer, Gabriele Farina, Marc Lanctot, Tuomas Sandholm

IJCAI 2023 Finding Mixed-Strategy Equilibria of Continuous-Action Games Without Gradients Using Randomized Policy Networks Carlos Martin, Tuomas Sandholm

ICMLW 2023 Game-Theoretic Robust Reinforcement Learning Handles Temporally-Coupled Perturbations Yongyuan Liang, Yanchao Sun, Ruijie Zheng, Xiangyu Liu, Tuomas Sandholm, Furong Huang, Stephen Marcus McAleer

ICLR 2023 Meta-Learning in Games Keegan Harris, Ioannis Anagnostides, Gabriele Farina, Mikhail Khodak, Steven Wu, Tuomas Sandholm

ICML 2023 Near-Optimal $φ$-Regret Learning in Extensive-Form Games Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm

NeurIPS 2023 On the Convergence of No-Regret Learning Dynamics in Time-Varying Games Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm

NeurIPS 2023 On the Interplay Between Social Welfare and Tractability of Equilibria Ioannis Anagnostides, Tuomas Sandholm

IJCAI 2023 Optimal Anytime Coalition Structure Generation Utilizing Compact Solution Space Representation Redha Taguelmimt, Samir Aknine, Djamila Boukredera, Narayan Changder, Tuomas Sandholm

ICML 2023 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

NeurIPS 2023 Team-PSRO for Learning Approximate TMECor in Large Team Games via Cooperative Reinforcement Learning Stephen McAleer, Gabriele Farina, Gaoyue Zhou, Mingzhi Wang, Yaodong Yang, Tuomas Sandholm

NeurIPSW 2022 ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret Stephen Marcus McAleer, Gabriele Farina, Marc Lanctot, Tuomas Sandholm

AAAI 2022 Fast Payoff Matrix Sparsification Techniques for Structured Extensive-Form Games Gabriele Farina, Tuomas Sandholm

NeurIPS 2022 Maximizing Revenue Under Market Shrinkage and Market Uncertainty Maria-Florina F Balcan, Siddharth Prasad, Tuomas Sandholm

NeurIPS 2022 Near-Optimal No-Regret Learning Dynamics for General Convex Games Gabriele Farina, Ioannis Anagnostides, Haipeng Luo, Chung-Wei Lee, Christian Kroer, Tuomas Sandholm

ICML 2022 On Last-Iterate Convergence Beyond Zero-Sum Games Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm

ICLRW 2022 Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation Brian Hu Zhang, Gabriele Farina, Andrea Celli, Tuomas Sandholm

NeurIPS 2022 Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games Ioannis Anagnostides, Gabriele Farina, Ioannis Panageas, Tuomas Sandholm

NeurIPS 2022 Polynomial-Time Optimal Equilibria with a Mediator in Extensive-Form Games Brian Zhang, Tuomas Sandholm

NeurIPS 2022 Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts Maria-Florina F Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik

NeurIPS 2022 Subgame Solving in Adversarial Team Games Brian Zhang, Luca Carminati, Federico Cacciamani, Gabriele Farina, Pierriccardo Olivieri, Nicola Gatti, Tuomas Sandholm

ICLRW 2022 Team Belief DAG Form: A Concise Representation for Team-Correlated Game-Theoretic Decision Making Brian Hu Zhang, Gabriele Farina, Tuomas Sandholm

AAAI 2022 Team Correlated Equilibria in Zero-Sum Extensive-Form Games via Tree Decompositions Brian Hu Zhang, Tuomas Sandholm

NeurIPS 2022 Uncoupled Learning Dynamics with $O(\log T)$ Swap Regret in Multiplayer Games Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Chung-Wei Lee, Haipeng Luo, Tuomas Sandholm

AAAI 2021 Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games Gabriele Farina, Robin Schmucker, Tuomas Sandholm

ICML 2021 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

NeurIPS 2021 Equilibrium Refinement for the Age of Machines: The One-Sided Quasi-Perfect Equilibrium Gabriele Farina, Tuomas Sandholm

AAAI 2021 Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent Gabriele Farina, Christian Kroer, Tuomas Sandholm

AAAI 2021 Finding and Certifying (Near-)Optimal Strategies in Black-Box Extensive-Form Games Brian Hu Zhang, Tuomas Sandholm

AAAI 2021 Generalization in Portfolio-Based Algorithm Selection Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik

IJCAI 2021 Learning Within an Instance for Designing High-Revenue Combinatorial Auctions Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm

AAAI 2021 Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games Gabriele Farina, Tuomas Sandholm

NeurIPS 2021 Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond Maria-Florina F Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik

NeurIPS 2021 Subgame Solving Without Common Knowledge Brian Zhang, Tuomas Sandholm

AAAI 2020 Coarse Correlation in Extensive-Form Games Gabriele Farina, Tommaso Bianchi, Tuomas Sandholm

IJCAI 2020 Efficient Algorithms for Learning Revenue-Maximizing Two-Part Tariffs Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm

NeurIPS 2020 Improving Policy-Constrained Kidney Exchange via Pre-Screening Duncan McElfresh, Michael Curry, Tuomas Sandholm, John Dickerson

AAAI 2020 Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik

NeurIPS 2020 Polynomial-Time Computation of Optimal Correlated Equilibria in Two-Player Extensive-Form Games with Public Chance Moves and Beyond Gabriele Farina, Tuomas Sandholm

ICML 2020 Refined Bounds for Algorithm Configuration: The Knife-Edge of Dual Class Approximability Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik

NeurIPS 2020 Small Nash Equilibrium Certificates in Very Large Games Brian Zhang, Tuomas Sandholm

ICML 2020 Sparsified Linear Programming for Zero-Sum Equilibrium Finding Brian Zhang, Tuomas Sandholm

ICML 2020 Stochastic Regret Minimization in Extensive-Form Games Gabriele Farina, Christian Kroer, Tuomas Sandholm

NeurIPS 2019 Correlation in Extensive-Form Games: Saddle-Point Formulation and Benchmarks Gabriele Farina, Chun Kai Ling, Fei Fang, Tuomas Sandholm

ICML 2019 Deep Counterfactual Regret Minimization Noam Brown, Adam Lerer, Sam Gross, Tuomas Sandholm

NeurIPS 2019 Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium Gabriele Farina, Chun Kai Ling, Fei Fang, Tuomas Sandholm

AAAI 2019 Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games Gabriele Farina, Christian Kroer, Tuomas Sandholm

NeurIPS 2019 Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions Gabriele Farina, Christian Kroer, Tuomas Sandholm

AAAI 2019 Quasi-Perfect Stackelberg Equilibrium Alberto Marchesi, Gabriele Farina, Christian Kroer, Nicola Gatti, Tuomas Sandholm

ICML 2019 Regret Circuits: Composability of Regret Minimizers Gabriele Farina, Christian Kroer, Tuomas Sandholm

AAAI 2019 Solving Imperfect-Information Games via Discounted Regret Minimization Noam Brown, Tuomas Sandholm

ICML 2019 Stable-Predictive Optimistic Counterfactual Regret Minimization Gabriele Farina, Christian Kroer, Noam Brown, Tuomas Sandholm

NeurIPS 2018 A Unified Framework for Extensive-Form Game Abstraction with Bounds Christian Kroer, Tuomas Sandholm

NeurIPS 2018 Depth-Limited Solving for Imperfect-Information Games Noam Brown, Tuomas Sandholm, Brandon Amos

NeurIPS 2018 Ex Ante Coordination and Collusion in Zero-Sum Multi-Player Extensive-Form Games Gabriele Farina, Andrea Celli, Nicola Gatti, Tuomas Sandholm

ICML 2018 Learning to Branch Maria-Florina Balcan, Travis Dick, Tuomas Sandholm, Ellen Vitercik

NeurIPS 2018 Practical Exact Algorithm for Trembling-Hand Equilibrium Refinements in Games Gabriele Farina, Nicola Gatti, Tuomas Sandholm

AAAI 2018 Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead Christian Kroer, Gabriele Farina, Tuomas Sandholm

NeurIPS 2018 Solving Large Sequential Games with the Excessive Gap Technique Christian Kroer, Gabriele Farina, Tuomas Sandholm

IJCAI 2018 Trembling-Hand Perfection in Extensive-Form Games with Commitment Gabriele Farina, Alberto Marchesi, Christian Kroer, Nicola Gatti, Tuomas Sandholm

AAAI 2017 Dynamic Thresholding and Pruning for Regret Minimization Noam Brown, Christian Kroer, Tuomas Sandholm

AAAI 2017 Exclusion Method for Finding Nash Equilibrium in Multiplayer Games Kimmo Berg, Tuomas Sandholm

IJCAI 2017 Libratus: The Superhuman AI for No-Limit Poker Noam Brown, Tuomas Sandholm

JAIR 2017 Multi-Organ Exchange John P. Dickerson, Tuomas Sandholm

IJCAI 2017 Operation Frames and Clubs in Kidney Exchange Gabriele Farina, John P. Dickerson, Tuomas Sandholm

ICML 2017 Reduced Space and Faster Convergence in Imperfect-Information Games via Pruning Noam Brown, Tuomas Sandholm

ICML 2017 Regret Minimization in Behaviorally-Constrained Zero-Sum Games Gabriele Farina, Christian Kroer, Tuomas Sandholm

NeurIPS 2017 Safe and Nested Subgame Solving for Imperfect-Information Games Noam Brown, Tuomas Sandholm

AAAI 2017 Small Representations of Big Kidney Exchange Graphs John P. Dickerson, Aleksandr M. Kazachkov, Ariel D. Procaccia, Tuomas Sandholm

IJCAI 2017 Smoothing Method for Approximate Extensive-Form Perfect Equilibrium Christian Kroer, Gabriele Farina, Tuomas Sandholm

IJCAI 2017 Super-Human AI for Strategic Reasoning: Beating Top Pros in Heads-up No-Limit Texas Hold'em Tuomas Sandholm

IJCAI 2016 Baby Tartanian8: Winning Agent from the 2016 Annual Computer Poker Competition Noam Brown, Tuomas Sandholm

AAAI 2016 Fast Optimal Clearing of Capped-Chain Barter Exchanges Benjamin Plaut, John P. Dickerson, Tuomas Sandholm

NeurIPS 2016 Sample Complexity of Automated Mechanism Design Maria-Florina F Balcan, Tuomas Sandholm, Ellen Vitercik

IJCAI 2016 Scalable Segment Abstraction Method for Advertising Campaign Admission and Inventory Allocation Optimization Fei Peng, Tuomas Sandholm

IJCAI 2016 Sequential Planning for Steering Immune System Adaptation Christian Kroer, Tuomas Sandholm

AAAI 2016 Strategy-Based Warm Starting for Regret Minimization in Games Noam Brown, Tuomas Sandholm

AAAI 2015 Abstraction for Solving Large Incomplete-Information Games Tuomas Sandholm

AAAI 2015 FutureMatch: Combining Human Value Judgments and Machine Learning to Match in Dynamic Environments John P. Dickerson, Tuomas Sandholm

IJCAI 2015 Limited Lookahead in Imperfect-Information Games Christian Kroer, Tuomas Sandholm

NeurIPS 2015 Regret-Based Pruning in Extensive-Form Games Noam Brown, Tuomas Sandholm

IJCAI 2015 Simultaneous Abstraction and Equilibrium Finding in Games Noam Brown, Tuomas Sandholm

AAAI 2015 Steering Evolution Strategically: Computational Game Theory and Opponent Exploitation for Treatment Planning, Drug Design, and Synthetic Biology Tuomas Sandholm

AAAI 2015 Strategy-Proof and Efficient Kidney Exchange Using a Credit Mechanism Chen Hajaj, John P. Dickerson, Avinatan Hassidim, Tuomas Sandholm, David Sarne

AAAI 2015 Tartanian7: A Champion Two-Player No-Limit Texas Hold'em Poker-Playing Program Noam Brown, Sam Ganzfried, Tuomas Sandholm

NeurIPS 2014 Diverse Randomized Agents Vote to Win Albert Jiang, Leandro Soriano Marcolino, Ariel D Procaccia, Tuomas Sandholm, Nisarg Shah, Milind Tambe

AAAI 2014 Multi-Organ Exchange: The Whole Is Greater than the Sum of Its Parts John P. Dickerson, Tuomas Sandholm

AAAI 2014 Potential-Aware Imperfect-Recall Abstraction with Earth Mover's Distance in Imperfect-Information Games Sam Ganzfried, Tuomas Sandholm

AAAI 2014 Regret Transfer and Parameter Optimization Noam Brown, Tuomas Sandholm

AAAI 2014 The Computational Rise and Fall of Fairness John P. Dickerson, Jonathan R. Goldman, Jeremy Karp, Ariel D. Procaccia, Tuomas Sandholm

IJCAI 2013 Action Translation in Extensive-Form Games with Large Action Spaces: Axioms, Paradoxes, and the Pseudo-Harmonic Mapping Sam Ganzfried, Tuomas Sandholm

AAAI 2013 Algorithms for Strong Nash Equilibrium with More than Two Agents Nicola Gatti, Marco Rocco, Tuomas Sandholm

IJCAI 2013 Analysis and Optimization of Multi-Dimensional Percentile Mechanisms Xin Sui, Craig Boutilier, Tuomas Sandholm

UAI 2012 Combining Local Search Techniques and Path Following for Bimatrix Games Nicola Gatti, Giorgio Patrini, Marco Rocco, Tuomas Sandholm

AAAI 2012 Dynamic Matching via Weighted Myopia with Application to Kidney Exchange John P. Dickerson, Ariel D. Procaccia, Tuomas Sandholm

AAAI 2012 Optimal Auctions for Spiteful Bidders Pingzhong Tang, Tuomas Sandholm

IJCAI 2011 Approximating Optimal Combinatorial Auctions for Complements Using Restricted Welfare Maximization Pingzhong Tang, Tuomas Sandholm

JAIR 2010 Algorithms for Closed Under Rational Behavior (CURB) Sets Michael Benisch, George B. Davis, Tuomas Sandholm

AAAI 2010 Asymmetric Spite in Auctions Ankit Sharma, Tuomas Sandholm

AAAI 2010 Automated Channel Abstraction for Advertising Auctions William E. Walsh, Craig Boutilier, Tuomas Sandholm, Rob Shields, George L. Nemhauser, David C. Parkes

AAAI 2010 Envy Quotes and the Iterated Core-Selecting Combinatorial Auction Abraham Othman, Tuomas Sandholm

IJCAI 2009 Computing Equilibria in Multiplayer Stochastic Games of Imperfect Information Sam Ganzfried, Tuomas Sandholm

IJCAI 2009 How Pervasive Is the Myerson-Satterthwaite Impossibility? Abraham Othman, Tuomas Sandholm

IJCAI 2009 Methodology for Designing Reasonably Expressive Mechanisms with Application to Ad Auctions Michael Benisch, Norman M. Sadeh, Tuomas Sandholm

IJCAI 2009 Online Stochastic Optimization in the Large: Application to Kidney Exchange Pranjal Awasthi, Tuomas Sandholm

AAAI 2008 A Theory of Expressiveness in Mechanisms Michael Benisch, Norman M. Sadeh, Tuomas Sandholm

AAAI 2008 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

AAAI 2008 Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker Andrew Gilpin, Tuomas Sandholm

AAAI 2008 Expressive Banner Ad Auctions and Model-Based Online Optimization for Clearing Craig Boutilier, David C. Parkes, Tuomas Sandholm, William E. Walsh

AAAI 2008 First-Order Algorithm with O(ln(1/e)) Convergence for E-Equilibrium in Two-Person Zero-Sum Games Andrew Gilpin, Javier Peña, Tuomas Sandholm

MLJ 2007 AWESOME: A General Multiagent Learning Algorithm That Converges in Self-Play and Learns a Best Response Against Stationary Opponents Vincent Conitzer, Tuomas Sandholm

IJCAI 2007 Automated Design of Multistage Mechanisms Tuomas Sandholm, Vincent Conitzer, Craig Boutilier

AAAI 2007 Automated Online Mechanism Design and Prophet Inequalities Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tuomas Sandholm

IJCAI 2007 Incremental Mechanism Design Vincent Conitzer, Tuomas Sandholm

IJCAI 2007 Information-Theoretic Approaches to Branching in Search Andrew Gilpin, Tuomas Sandholm

AAAI 2007 Potential-Aware Automated Abstraction of Sequential Games, and Holistic Equilibrium Analysis of Texas Hold'em Poker Andrew Gilpin, Tuomas Sandholm, Troels Bjerre Sørensen

IJCAI 2007 Spiteful Bidding in Sealed-Bid Auctions Felix Brandt, Tuomas Sandholm, Yoav Shoham

AAAI 2006 A Compact Representation Scheme for Coalitional Games in Open Anonymous Environments Naoki Ohta, Atsushi Iwasaki, Makoto Yokoo, Kohki Maruono, Vincent Conitzer, Tuomas Sandholm

AAAI 2006 A Competitive Texas Hold'em Poker Player via Automated Abstraction and Real-Time Equilibrium Computation Andrew Gilpin, Tuomas Sandholm

AAAI 2006 Algorithms for Rationalizability and CURB Sets Michael Benisch, George B. Davis, Tuomas Sandholm

AAAI 2006 Expressive Commerce and Its Application to Sourcing Tuomas Sandholm

AAAI 2006 Nonexistence of Voting Rules That Are Usually Hard to Manipulate Vincent Conitzer, Tuomas Sandholm

AAAI 2005 A Generalized Strategy Eliminability Criterion and Computational Methods for Applying It Vincent Conitzer, Tuomas Sandholm

AAAI 2005 Approximating Revenue-Maximizing Combinatorial Auctions Anton Likhodedov, Tuomas Sandholm

AAAI 2005 Coalitional Games in Open Anonymous Environments Makoto Yokoo, Vincent Conitzer, Tuomas Sandholm, Naoki Ohta, Atsushi Iwasaki

IJCAI 2005 Coalitional Games in Open Anonymous Environments Makoto Yokoo, Vincent Conitzer, Tuomas Sandholm, Naoki Ohta, Atsushi Iwasaki

AAAI 2005 Combinatorial Auctions with K-Wise Dependent Valuations Vincent Conitzer, Tuomas Sandholm, Paolo Santi

UAI 2005 Common Voting Rules as Maximum Likelihood Estimators Vincent Conitzer, Tuomas Sandholm

AAAI 2005 Expressive Negotiation in Settings with Externalities Vincent Conitzer, Tuomas Sandholm

AAAI 2005 Mixed-Integer Programming Methods for Finding Nash Equilibria Tuomas Sandholm, Andrew Gilpin, Vincent Conitzer

AAAI 2005 Optimal Rhode Island Hold'em Poker Andrew Gilpin, Tuomas Sandholm

AAAI 2004 Combinatorial Auctions with Structured Item Graphs Vincent Conitzer, Jonathan Derryberry, Tuomas Sandholm

ICML 2004 Communication Complexity as a Lower Bound for Learning in Games Vincent Conitzer, Tuomas Sandholm

AAAI 2004 Computing Shapley Values, Manipulating Value Division Schemes, and Checking Core Membership in Multi-Issue Domains Vincent Conitzer, Tuomas Sandholm

AAAI 2004 Eliciting Bid Taker Non-Price Preferences in (Combinatorial) Auctions Craig Boutilier, Tuomas Sandholm, Rob Shields

AAAI 2004 Methods for Boosting Revenue in Combinatorial Auctions Anton Likhodedov, Tuomas Sandholm

JMLR 2004 Preference Elicitation and Query Learning (Special Topic on Learning Theory) Avrim Blum, Jeffrey Jackson, Tuomas Sandholm, Martin Zinkevich

COLT 2004 Towards a Characterization of Polynomial Preference Elicitation with Value Queries in Combinatorial Auctions (Extended Abstract) Paolo Santi, Vincent Conitzer, Tuomas Sandholm

AAAI 2004 Using Performance Profile Trees to Improve Deliberation Control Kate Larson, Tuomas Sandholm

ICML 2003 AWESOME: A General Multiagent Learning Algorithm That Converges in Self-Play and Learns a Best Response Against Stationary Opponents Vincent Conitzer, Tuomas Sandholm

ICML 2003 BL-WoLF: A Framework for Loss-Bounded Learnability in Zero-Sum Games Vincent Conitzer, Tuomas Sandholm

IJCAI 2003 Complexity Results About Nash Equilibria Vincent Conitzer, Tuomas Sandholm

IJCAI 2003 Complexity of Determining Nonemptiness of the Core Vincent Conitzer, Tuomas Sandholm

IJCAI 2003 Definition and Complexity of Some Basic Metareasoning Problems Vincent Conitzer, Tuomas Sandholm

NeurIPS 2003 Learning Near-Pareto-Optimal Conventions in Polynomial Time Xiaofeng Wang, Tuomas Sandholm

IJCAI 2003 Making Markets and Democracy Work: A Story of Incentives and Computing Tuomas Sandholm

COLT 2003 Preference Elicitation and Query Learning Avrim Blum, Jeffrey C. Jackson, Tuomas Sandholm, Martin Zinkevich

IJCAI 2003 Universal Voting Protocol Tweaks to Make Manipulation Hard Vincent Conitzer, Tuomas Sandholm

AAAI 2002 (Im)possibility of Safe Exchange Mechanism Design Tuomas Sandholm, Xiao Feng Wang

AAAI 2002 Complexity of Manipulating Elections with Few Candidates Vincent Conitzer, Tuomas Sandholm

UAI 2002 Complexity of Mechanism Design Vincent Conitzer, Tuomas Sandholm

AAAI 2002 Partial-Revelation VCG Mechanism for Combinatorial Auctions Wolfram Conen, Tuomas Sandholm

NeurIPS 2002 Reinforcement Learning to Play an Optimal Nash Equilibrium in Team Markov Games Xiaofeng Wang, Tuomas Sandholm

AAAI 2002 Vote Elicitation: Complexity and Strategy-Proofness Vincent Conitzer, Tuomas Sandholm

IJCAI 2001 CABOB: A Fast Optimal Algorithm for Combinatorial Auctions Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine

IJCAI 2001 Market Clearability Tuomas Sandholm, Subhash Suri

AAAI 2000 Deliberation in Equilibrium: Bargaining in Computationally Complex Problems Kate Larson, Tuomas Sandholm

AAAI 2000 Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations Tuomas Sandholm, Subhash Suri

IJCAI 1999 Algorithms for Optimizing Leveled Commitment Contracts Tuomas Sandholm, Sandeep Sikka, Samphel Norden

IJCAI 1999 An Algorithm for Optimal Winner Determination in Combinatorial Auctions Tuomas Sandholm

AAAI 1999 Bargaining with Deadlines Tuomas Sandholm, Nir Vulkan

AAAI 1999 Power, Dependence and Stability in Multiagent Plans Sviatoslav B. Brainov, Tuomas Sandholm

AAAI 1999 Time-Quality Tradeoffs in Reallocative Negotiation with Combinatorial Contract Types Martin Andersson, Tuomas Sandholm

AAAI 1999 eMediator: A Next Generation Electronic Commerce Server Tuomas Sandholm

AAAI 1998 Anytime Coalition Structure Generation with Worst Case Guarantees Tuomas Sandholm, Kate Larson, Martin Andersson, Onn Shehory, Fernando Tohmé

AAAI 1998 Leveled Commitment Contracts with Myopic and Strategic Agents Martin Andersson, Tuomas Sandholm

IJCAI 1997 On the Gains and Losses of Speculation in Equilibrium Markets Tuomas Sandholm, Fredrik Ygge

AAAI 1996 A Second Order Parameter for 3SAT Tuomas Sandholm

AAAI 1996 Advantages of a Leveled Commitment Contracting Protocol Tuomas Sandholm, Victor R. Lesser

IJCAI 1995 Coalition Formation Among Bounded Rational Agents Tuomas Sandholm, Victor R. Lesser

IJCAI 1995 Equilibrium Analysis of the Possibilities of Unenforced Exchange in Multiagent Systems Tuomas Sandholm, Victor R. Lesser

AAAI 1994 Exploiting Meta-Level Information in a Distributed Scheduling System Daniel E. Neiman, David W. Hildum, Victor R. Lesser, Tuomas Sandholm

AAAI 1993 An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations Tuomas Sandholm