An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations. - Tuomas Sandholm (AAAI, 1993)

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

Issues in Automated Negotiation and Electronic Commerce: Extending the Contract Net Framework. - Tuomas Sandholm; Victor R. Lesser (ICMAS, 1995)

On Multiagent Q-Learning in a Semi-Competitive Domain. - Tuomas Sandholm; Robert H. Crites (Adaption and Learning in Multi-Agent Systems, 1995)

Coalition Formation among Bounded Rational Agents. - Tuomas Sandholm; Victor R. Lesser (IJCAI (1), 1995)

Equilibrium Analysis of the Possibilities of Unenforced Exchange in Multiagent Systems. - Tuomas Sandholm; Victor R. Lesser (IJCAI (1), 1995)

A Second Order Parameter for 3SAT. - Tuomas Sandholm (AAAI/IAAI, Vol. 1, 1996)

Advantages of a Leveled Commitment Contracting Protocol. - Tuomas Sandholm; Victor R. Lesser (AAAI/IAAI, Vol. 1, 1996)

On the Gains and Losses of Speculation in Equilibrium Markets. - Tuomas Sandholm; Fredrik Ygge (IJCAI (1), 1997)

Coalitions Among Computationally Bounded Agents. - Tuomas Sandholm; Victor R. Lesser (Artif. Intell., 1997)

Unenforced E-Commerce Transactions. - Tuomas Sandholm (IEEE Internet Comput., 1997)

Leveled Commitment Contracts with Myopic and Strategic Agents. - Martin Andersson; Tuomas Sandholm (AAAI/IAAI, 1998)

Anytime Coalition Structure Generation with Worst Case Guarantees. - Tuomas Sandholm; Kate Larson; Martin Andersson; Onn Shehory; Fernando Tohmé (AAAI/IAAI, 1998)

Agent-Mediated Electronic Commerce: Issues, Challenges and Some Viewpoints. - Hyacinth S. Nwana; Jeffrey S. Rosenschein; Tuomas Sandholm; Carles Sierra; Pattie Maes; Robert H. Guttman (Agents, 1998)

Sequencing of Contract Types for Anytime Task Reallocation. - Martin Andersson; Tuomas Sandholm (AMET, 1998)

Leveled Commitment Contracting among Myopic Individually Rational Agents. - Martin Andersson; Tuomas Sandholm (ICMAS, 1998)

Agents in Electronic Commerce: Component Technologies for Automated Negotiation and Coalition Formation. - Tuomas Sandholm (ICMAS, 1998)

Time-Quality Tradeoffs in Reallocative Negotiation with Combinatorial Contract Types. - Martin Andersson; Tuomas Sandholm (AAAI/IAAI, 1999)

Power, Dependence and Stability in Multiagent Plans. - Sviatoslav B. Brainov; Tuomas Sandholm (AAAI/IAAI, 1999)

Bargaining with Deadlines. - Tuomas Sandholm; Nir Vulkan (AAAI/IAAI, 1999)

An Algorithm for Optimal Winner Determination in Combinatorial Auctions. - Tuomas Sandholm (IJCAI, 1999)

Algorithms for Optimizing Leveled Commitment Contracts. - Tuomas Sandholm; Sandeep Sikka; Samphel Norden (IJCAI, 1999)

Coalition Structure Generation with Worst Case Guarantees. - Tuomas Sandholm; Kate Larson; Martin Andersson; Onn Shehory; Fernando Tohmé (Artif. Intell., 1999)

Automated Negotiation. - Tuomas Sandholm (Commun. ACM, 1999)

Coalition Formation Processes with Belief Revision among Bounded-rational Self-interested Agents. - Fernando Tohmé; Tuomas Sandholm (J. Log. Comput., 1999)

Deliberation in Equilibrium: Bargaining in Computationally Complex Problems. - Kate Larson; Tuomas Sandholm (AAAI/IAAI, 2000)

Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations. - Tuomas Sandholm; Subhash Suri (AAAI/IAAI, 2000)

eMediator: a next generation electronic commerce server. - Tuomas Sandholm (Agents, 2000)

Contract Type Sequencing for Reallocative Negotiation. - Martin Andersson; Tuomas Sandholm (ICDCS, 2000)

Reasoning About Others: Representing and Processing Infinite Belief Hierarchies. - Sviatoslav B. Brainov; Tuomas Sandholm (ICMAS, 2000)

Safe Exchange Planner. - Tuomas Sandholm; Vincent Ferrandon (ICMAS, 2000)

Optimal Flow Aggregation. - Subhash Suri; Tuomas Sandholm; Priyank Ramesh Warkhede (SWAT, 2000)

Agents in Electronic Commerce: Component Technologies for Automated Negation and Coalition Formation. - Tuomas Sandholm (Auton. Agents Multi Agent Syst., 2000)

Approaches to winner determination in combinatorial auctions. - Tuomas Sandholm (Decis. Support Syst., 2000)

Issues in Computational Vickrey Auctions. - Tuomas Sandholm (Int. J. Electron. Commer., 2000)

Nomad: Mobile Agent System for an Internet-Based Auction House. - Tuomas Sandholm; Qianbo Huai (IEEE Internet Comput., 2000)

Anytime coalition structure generation: an average case study. - Kate Larson; Tuomas Sandholm (J. Exp. Theor. Artif. Intell., 2000)

Automated contracting in distributed manufacturing among independent companies. - Tuomas Sandholm (J. Intell. Manuf., 2000)

Market Clearability. - Tuomas Sandholm; Subhash Suri (IJCAI, 2001)

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

Preference elicitation in combinatorial auctions. - Wolfram Conen; Tuomas Sandholm (EC, 2001)

Bargaining with limited computation: Deliberation equilibrium. - Kate Larson; Tuomas Sandholm (Artif. Intell., 2001)

Leveled Commitment Contracts and Strategic Breach. - Tuomas Sandholm; Victor R. Lesser (Games Econ. Behav., 2001)

Partial-Revelation VCG Mechanism for Combinatorial Auctions. - Wolfram Conen; Tuomas Sandholm (AAAI/IAAI, 2002)

Complexity of Manipulating Elections with Few Candidates. - Vincent Conitzer; Tuomas Sandholm (AAAI/IAAI, 2002)

Vote Elicitation: Complexity and Strategy-Proofness. - Vincent Conitzer; Tuomas Sandholm (AAAI/IAAI, 2002)

(Im)possibility of Safe Exchange Mechanism Design. - Tuomas Sandholm; Xiao Feng Wang (AAAI/IAAI, 2002)

Differential -Revelation VCG Mechanisms for Combinatorial Auctions. - Wolfram Conen; Tuomas Sandholm (AMEC, 2002)

Effectiveness of Preference Elicitation in Combinatorial Auctions. - Benoît Hudson; Tuomas Sandholm (AMEC, 2002)

Incentive compatible mechanism for trust revelation. - Sviatoslav B. Braynov; Tuomas Sandholm (AAMAS, 2002)

An alternating offers bargaining model for computationally limited agents. - Kate Larson; Tuomas Sandholm (AAMAS, 2002)

Bidders with hard valuation problems. - Kate Larson; Tuomas Sandholm (AAMAS, 2002)

Winner determination in combinatorial auction generalizations. - Tuomas Sandholm; Subhash Suri; Andrew Gilpin; David Levine (AAMAS, 2002)

Market Clearing with Supply and Demand Curves. - Tuomas Sandholm; Subhash Suri (ISAAC, 2002)

Reinforcement Learning to Play an Optimal Nash Equilibrium in Team Markov Games. - Xiaofeng Wang; Tuomas Sandholm (NIPS, 2002)

Complexity of Mechanism Design. - Vincent Conitzer; Tuomas Sandholm (UAI, 2002)

Algorithm for optimal winner determination in combinatorial auctions. - Tuomas Sandholm (Artif. Intell., 2002)

Surplus equivalence of leveled commitment contracts. - Tuomas Sandholm; Yunhong Zhou (Artif. Intell., 2002)

Leveled-Commitment Contracting: A Backtracking Instrument for Multiagent Systems. - Tuomas Sandholm; Victor R. Lesser (AI Mag., 2002)

Contracting With Uncertain Level Of Trust. - Sviatoslav B. Braynov; Tuomas Sandholm (Comput. Intell., 2002)

eMediator: A Next Generation Electronic Commerce Server. - Tuomas Sandholm (Comput. Intell., 2002)

Automated mechanism design: complexity results stemming from the single-agent setting. - Vincent Conitzer; Tuomas Sandholm (ICEC, 2003)

Mechanism for Optimally Trading Off Revenue and Efficiency in Multi-unit Auctions. - Anton Likhodedov; Tuomas Sandholm (AMEC, 2003)

Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation. - Tuomas Sandholm; Andrew Gilpin (AMEC, 2003)

Generalizing preference elicitation in combinatorial auctions. - Benoît Hudson; Tuomas Sandholm (AAMAS, 2003)

Miscomputing ratio: social cost of selfish computing. - Kate Larson; Tuomas Sandholm (AAMAS, 2003)

Automated Mechanism Design: A New Application Area for Search Algorithms. - Tuomas Sandholm (CP, 2003)

Terminating Decision Algorithms Optimally. - Tuomas Sandholm (CP, 2003)

BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games. - Vincent Conitzer; Tuomas Sandholm (ICML, 2003)

Complexity of Determining Nonemptiness of the Core. - Vincent Conitzer; Tuomas Sandholm (IJCAI, 2003)

Complexity Results about Nash Equilibria. - Vincent Conitzer; Tuomas Sandholm (IJCAI, 2003)

Universal Voting Protocol Tweaks to Make Manipulation Hard. - Vincent Conitzer; Tuomas Sandholm (IJCAI, 2003)

Definition and Complexity of Some Basic Metareasoning Problems. - Vincent Conitzer; Tuomas Sandholm (IJCAI, 2003)

Making Markets and Democracy Work: A Story of Incentives and Computing. - Tuomas Sandholm (IJCAI, 2003)

Learning Near-Pareto-Optimal Conventions in Polynomial Time. - Xiao Feng Wang; Tuomas Sandholm (NIPS, 2003)

Automated mechanism design for a self-interested designer. - Vincent Conitzer; Tuomas Sandholm (EC, 2003)

Using value queries in combinatorial auctions. - Benoît Hudson; Tuomas Sandholm (EC, 2003)

Solving combinatorial exchanges: optimality via a few partial bids. - Anshul Kothari; Tuomas Sandholm; Subhash Suri (EC, 2003)

Auction mechanism for optimally trading off revenue and efficiency. - Anton Likhodedov; Tuomas Sandholm (EC, 2003)

On polynomial-time preference elicitation with value queries. - Martin Zinkevich; Avrim Blum; Tuomas Sandholm (EC, 2003)

How many candidates are needed to make elections hard to manipulate? - Vincent Conitzer; Jérôme Lang; Tuomas Sandholm (TARK, 2003)

Auctions with Untrustworthy Bidders. - Sviatoslav B. Braynov; Tuomas Sandholm (CEC, 2003)

BOB: Improved winner determination in combinatorial auctions and generalizations. - Tuomas Sandholm; Subhash Suri (Artif. Intell., 2003)

Compressing Two-Dimensional Routing Tables. - Subhash Suri; Tuomas Sandholm; Priyank Ramesh Warkhede (Algorithmica, 2003)

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

Combinatorial Auctions with Structured Item Graphs. - Vincent Conitzer; Jonathan Derryberry; 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)

Using Performance Profile Trees to Improve Deliberation Control. - Kate Larson; Tuomas Sandholm (AAAI, 2004)

Methods for Boosting Revenue in Combinatorial Auctions. - Anton Likhodedov; Tuomas Sandholm (AAAI, 2004)

Revenue Failures and Collusion in Combinatorial Auctions and Exchanges with VCG Payments. - Vincent Conitzer; Tuomas Sandholm (AMEC, 2004)

Designing Auctions for Deliberative Agents. - Kate Larson; Tuomas Sandholm (AMEC, 2004)

Im)Possibility of Unconditionally Privacy-Preserving Auctions. - Felix Brandt 001; Tuomas Sandholm (AAMAS, 2004)

Anonymous Pricing of Efficient Allocations in Combinatorial Economies. - Wolfram Conen; Tuomas Sandholm (AAMAS, 2004)

An Algorithm for Automatically Designing Deterministic Mechanisms without Payments. - Vincent Conitzer; Tuomas Sandholm (AAMAS, 2004)

Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions. - Benoît Hudson; Tuomas Sandholm (AAMAS, 2004)

Experiments on Deliberation Equilibria in Auctions. - Kate Larson; Tuomas Sandholm (AAMAS, 2004)

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

Communication complexity as a lower bound for learning in games. - Vincent Conitzer; Tuomas Sandholm (ICML, 2004)

Expressive negotiation over donations to charities. - Vincent Conitzer; Tuomas Sandholm (EC, 2004)

Self-interested automated mechanism design and implications for optimal combinatorial auctions. - Vincent Conitzer; Tuomas Sandholm (EC, 2004)

Computational criticisms of the revelation principle. - Vincent Conitzer; Tuomas Sandholm (EC, 2004)

Strategic deliberation and truthful revelation: an impossibility result. - Kate Larson; Tuomas Sandholm (EC, 2004)

Preference Elicitation and Query Learning. - Avrim Blum; Jeffrey C. Jackson; Tuomas Sandholm; Martin Zinkevich (J. Mach. Learn. Res., 2004)

Expressive Negotiation in Settings with Externalities. - Vincent Conitzer; Tuomas Sandholm (AAAI, 2005)

A Generalized Strategy Eliminability Criterion and Computational Methods for Applying It. - Vincent Conitzer; Tuomas Sandholm (AAAI, 2005)

Combinatorial Auctions with k-wise Dependent Valuations. - Vincent Conitzer; Tuomas Sandholm; Paolo Santi (AAAI, 2005)

Optimal Rhode Island Hold'em Poker. - Andrew Gilpin; Tuomas Sandholm (AAAI, 2005)

Approximating Revenue-Maximizing Combinatorial Auctions. - Anton Likhodedov; Tuomas Sandholm (AAAI, 2005)

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

Coalitional Games in Open Anonymous Environments. - Makoto Yokoo; Vincent Conitzer; Tuomas Sandholm; Naoki Ohta; Atsushi Iwasaki (AAAI, 2005)

Decentralized voting with unconditional privacy. - Felix Brandt 001; Tuomas Sandholm (AAMAS, 2005)

Mechanism design and deliberative agents. - Kate Larson; Tuomas Sandholm (AAMAS, 2005)

05011 Executive Summary - Computing and Markets. - Daniel Lehmann 001; Rudolf Müller; Tuomas Sandholm (Computing and Markets, 2005)

05011 Abstracts Collection - Computing and Markets. - Daniel Lehmann 001; Rudolf Müller; Tuomas Sandholm (Computing and Markets, 2005)

Automated Mechanism Design. - Tuomas Sandholm (Computing and Markets, 2005)

Efficient Privacy-Preserving Protocols for Multi-unit Auctions. - Felix Brandt 001; Tuomas Sandholm (Financial Cryptography, 2005)

On Correctness and Privacy in Distributed Mechanisms. - Felix Brandt 001; Tuomas Sandholm (AMEC@AAMAS/TADA@IJCAI, 2005)

A New Solution Concept for Coalitional Games in Open Anonymous Environments. - Makoto Yokoo; Vincent Conitzer; Tuomas Sandholm; Naoki Ohta; Atsushi Iwasaki (JSAI Workshops, 2005)

Communication complexity of common voting rules. - Vincent Conitzer; Tuomas Sandholm (EC, 2005)

Complexity of (iterated) dominance. - Vincent Conitzer; Tuomas Sandholm (EC, 2005)

Unconditional privacy in social choice. - Felix Brandt 001; Tuomas Sandholm (TARK, 2005)

Common Voting Rules as Maximum Likelihood Estimators. - Vincent Conitzer; Tuomas Sandholm (UAI, 2005)

CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions. - Tuomas Sandholm; Subhash Suri; Andrew Gilpin; David Levine (Manag. Sci., 2005)

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

Nonexistence of Voting Rules That Are Usually Hard to Manipulate. - 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)

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)

Expressive Commerce and Its Application to Sourcing. - Tuomas Sandholm (AAAI, 2006)

Failures of the VCG mechanism in combinatorial auctions and exchanges. - Vincent Conitzer; Tuomas Sandholm (AAMAS, 2006)

A technique for reducing normal-form games to compute a Nash equilibrium. - Vincent Conitzer; Tuomas Sandholm (AAMAS, 2006)

A Texas Hold'em poker player based on automated abstraction and real-time equilibrium computation. - Andrew Gilpin; Tuomas Sandholm (AAMAS, 2006)

Computing the optimal strategy to commit to. - Vincent Conitzer; Tuomas Sandholm (EC, 2006)

Finding equilibria in large sequential games of imperfect information. - Andrew Gilpin; Tuomas Sandholm (EC, 2006)

Complexity of constructing solutions in the core based on synergies among coalitions. - Vincent Conitzer; Tuomas Sandholm (Artif. Intell., 2006)

Side constraints and non-price attributes in markets. - Tuomas Sandholm; Subhash Suri (Games Econ. Behav., 2006)

Changing the Game in Strategic Sourcing at Procter & Gamble: Expressive Competition Enabled by Optimization. - Tuomas Sandholm; David Levine; Michael Concordia; Paul Martyn; Rick Hughes; Jim Jacobs; Dennis Begg (Interfaces, 2006)

Online algorithms for market clearing. - Avrim Blum; Tuomas Sandholm; Martin Zinkevich (J. ACM, 2006)

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

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

Expressive Commerce and Its Application to Sourcing: How We Conducted $25 Billion of Generalized Combinatorial Auctions. - Tuomas Sandholm (AAIM, 2007)

Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker. - Andrew Gilpin; Tuomas Sandholm (AAMAS, 2007)

07431 Executive Summary - Computational Issues in Social Choice. - Ulle Endriss; Jérôme Lang; Francesca Rossi 001; Tuomas Sandholm (Computational Issues in Social Choice, 2007)

07431 Abstracts Collection - Computational Issues in Social Choice. - Ulle Endriss; Jérôme Lang; Francesca Rossi 001; Tuomas Sandholm (Computational Issues in Social Choice, 2007)

Spiteful Bidding in Sealed-Bid Auctions. - Felix Brandt 001; Tuomas Sandholm; Yoav Shoham (IJCAI, 2007)

Incremental Mechanism Design. - Vincent Conitzer; Tuomas Sandholm (IJCAI, 2007)

Automated Design of Multistage Mechanisms. - Tuomas Sandholm; Vincent Conitzer; Craig Boutilier (IJCAI, 2007)

Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges. - David J. Abraham; Avrim Blum; Tuomas Sandholm (EC, 2007)

Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games. - Andrew Gilpin; Samid Hoda; Javier Peña 001; Tuomas Sandholm (WINE, 2007)

Perspectives on multiagent learning. - Tuomas Sandholm (Artif. Intell., 2007)

Expressive Commerce and Its Application to Sourcing: How We Conducted $35 Billion of Generalized Combinatorial Auctions. - Tuomas Sandholm (AI Mag., 2007)

When are elections with few candidates hard to manipulate?. - Vincent Conitzer; Tuomas Sandholm; Jérôme Lang (J. ACM, 2007)

Lossless abstraction of imperfect information games. - Andrew Gilpin; Tuomas Sandholm (J. ACM, 2007)

AWESOME: A general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents. - Vincent Conitzer; Tuomas Sandholm (Mach. Learn., 2007)

A Theory of Expressiveness in Mechanisms. - Michael Benisch; Norman M. Sadeh; 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 001; Tuomas Sandholm (AAAI, 2008)

Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker. - Andrew Gilpin; 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)

Computing an approximate jam/fold equilibrium for 3-player no-limit Texas Hold'em tournaments. - Sam Ganzfried; Tuomas Sandholm (AAMAS (2), 2008)

Solving two-person zero-sum repeated games of incomplete information. - Andrew Gilpin; Tuomas Sandholm (AAMAS (2), 2008)

A heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding programs. - Andrew Gilpin; Tuomas Sandholm; Troels Bjerre Sørensen (AAMAS (2), 2008)

GS3 and Tartanian: game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs. - Andrew Gilpin; Tuomas Sandholm; Troels Bjerre Sørensen (AAMAS (Demos), 2008)

New complexity results about Nash equilibria. - Vincent Conitzer; Tuomas Sandholm (Games Econ. Behav., 2008)

On the Existence of Unconditionally Privacy-Preserving Auction Protocols. - Felix Brandt 001; Tuomas Sandholm (ACM Trans. Inf. Syst. Secur., 2008)

Online Stochastic Optimization in the Large: Application to Kidney Exchange. - Pranjal Awasthi; Tuomas Sandholm (IJCAI, 2009)

Methodology for Designing Reasonably Expressive Mechanisms with Application to Ad Auctions. - Michael Benisch; Norman M. Sadeh; 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)

Better with Byzantine: Manipulation-Optimal Mechanisms. - Abraham Othman; Tuomas Sandholm (SAGT, 2009)

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 (SOUPS, 2009)

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

Asymmetric Spite in Auctions. - Ankit Sharma 001; 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)

Computing equilibria by incorporating qualitative models? - Sam Ganzfried; Tuomas Sandholm (AAMAS, 2010)

Speeding up gradient-based algorithms for sequential games. - Andrew Gilpin; Tuomas Sandholm (AAMAS, 2010)

Combinatorial auctions with externalities. - Piotr Krysta; Tomasz P. Michalak; Tuomas Sandholm; Michael J. Wooldridge (AAMAS, 2010)

Decision rules and decision markets. - Abraham Othman; Tuomas Sandholm (AAMAS, 2010)

When do markets with simple agents fail? - Abraham Othman; Tuomas Sandholm (AAMAS, 2010)

Finding approximate competitive equilibria: efficient and fair course allocation. - Abraham Othman; Tuomas Sandholm; Eric Budish (AAMAS, 2010)

Automated market-making in the large: the gates hillman prediction market. - Abraham Othman; Tuomas Sandholm (EC, 2010)

The State of Solving Large Incomplete-Information Games, and Application to Poker. - Tuomas Sandholm (AI Mag., 2010)

Algorithms for Closed Under Rational Behavior (CURB) Sets. - Michael Benisch; George B. Davis; Tuomas Sandholm (J. Artif. Intell. Res., 2010)

Smoothing Techniques for Computing Nash Equilibria of Sequential Games. - Samid Hoda; Andrew Gilpin; Javier Peña 001; Tuomas Sandholm (Math. Oper. Res., 2010)

Strategy Purification. - Sam Ganzfried; Tuomas Sandholm; Kevin Waugh (Applied Adversarial Reasoning and Risk Modeling, 2011)

A Framework for Automated Bundling and Pricing Using Purchase Data. - Michael Benisch; Tuomas Sandholm (AMMA, 2011)

Automated Market Makers That Enable New Settings: Extending Constant-Utility Cost Functions. - Abraham Othman; Tuomas Sandholm (AMMA, 2011)

Game theory-based opponent modeling in large imperfect-information games. - Sam Ganzfried; Tuomas Sandholm (AAMAS, 2011)

Approximating Optimal Combinatorial Auctions for Complements Using Restricted Welfare Maximization. - Pingzhong Tang; Tuomas Sandholm (IJCAI, 2011)

Liquidity-Sensitive Automated Market Makers via Homogeneous Risk Measures. - Abraham Othman; Tuomas Sandholm (WINE, 2011)

Inventory-based versus Prior-based Options Trading Agents. - Abraham Othman; Tuomas Sandholm (Algorithmic Finance, 2011)

Expressive markets for donating to charities. - Vincent Conitzer; Tuomas Sandholm (Artif. Intell., 2011)

Information-theoretic approaches to branching in search. - Andrew Gilpin; Tuomas Sandholm (Discret. Optim., 2011)

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 (AAAI, 2012)

Towards Optimal Patrol Strategies for Fare Inspection in Transit Systems. - Albert Xin Jiang; Zhengyu Yin; Matthew P. Johnson 001; Milind Tambe; Christopher Kiekintveld; Kevin Leyton-Brown; Tuomas Sandholm (AAAI Spring Symposium: Game Theory for Security, Sustainability, and Health, 2012)

Optimizing kidney exchange with transplant chains: theory and reality. - John P. Dickerson; Ariel D. Procaccia; Tuomas Sandholm (AAMAS, 2012)

Strategy purification and thresholding: effective non-equilibrium approaches for playing large games. - Sam Ganzfried; Tuomas Sandholm; Kevin Waugh (AAMAS, 2012)

Rational market making with probabilistic knowledge. - Abraham Othman; Tuomas Sandholm (AAMAS, 2012)

Mixed-bundling auctions with reserve prices. - Pingzhong Tang; Tuomas Sandholm (AAMAS, 2012)

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 (IAAI, 2012)

Profit-charging market makers with bounded loss, vanishing bid/ask spreads, and unlimited market depth. - Abraham Othman; Tuomas Sandholm (EC, 2012)

Lossy stochastic game abstraction with bounds. - Tuomas Sandholm; Satinder Singh 001 (EC, 2012)

Combining local search techniques and path following for bimatrix games. - Nicola Gatti 001; Giorgio Patrini; Marco Rocco; Tuomas Sandholm (UAI, 2012)

TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems Using Game Theory. - Zhengyu Yin; Albert Xin Jiang; Milind Tambe; Christopher Kiekintveld; Kevin Leyton-Brown; Tuomas Sandholm; John P. Sullivan (AI Mag., 2012)

Computing optimal outcomes under an expressive representation of settings with externalities. - Vincent Conitzer; Tuomas Sandholm (J. Comput. Syst. Sci., 2012)

First-order algorithm with 𝒪(ln(1/ε)) convergence for ε-equilibrium in two-person zero-sum games. - Andrew Gilpin; Javier Peña 001; Tuomas Sandholm (Math. Program., 2012)

Throwing Darts: Random Sampling Helps Tree Search when the Number of Short Certificates is Moderate. - John Paul Dickerson; Tuomas Sandholm (AAAI (Late-Breaking Developments), 2013)

Algorithms for Strong Nash Equilibrium with More than Two Agents. - Nicola Gatti 001; Marco Rocco; Tuomas Sandholm (AAAI, 2013)

Strong Nash Equilibrium Is in Smoothed P. - Nicola Gatti 001; Marco Rocco; Tuomas Sandholm (AAAI (Late-Breaking Developments), 2013)

On the verification and computation of strong nash equilibrium. - Nicola Gatti 001; Marco Rocco; Tuomas Sandholm (AAMAS, 2013)

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

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

On the complexity of strong Nash equilibrium: Hard-to-solve instances and smoothed complexity - Nicola Gatti 001; Marco Rocco; Tuomas Sandholm (CoRR, 2013)

A Practical Liquidity-Sensitive Automated Market Maker. - Abraham Othman; David M. Pennock; Daniel M. Reeves; Tuomas Sandholm (ACM Trans. Economics and Comput., 2013)

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 (AAAI, 2014)

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

Balancing Efficiency and Fairness in Dynamic Kidney Exchange. - John Paul Dickerson; Tuomas Sandholm (AAAI Workshop: Modern Artificial Intelligence for Health Analytics, 2014)

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

Price of fairness in kidney exchange. - John P. Dickerson; Ariel D. Procaccia; Tuomas Sandholm (AAMAS, 2014)

Finding the pareto curve in bimatrix games is easy. - Nicola Gatti 001; Tuomas Sandholm (AAMAS, 2014)

Diverse Randomized Agents Vote to Win. - Albert Xin Jiang; Leandro Soriano Marcolino; Ariel D. Procaccia; Tuomas Sandholm; Nisarg Shah 001; Milind Tambe (NIPS, 2014)

Extensive-form game abstraction with bounds. - Christian Kroer; Tuomas Sandholm (EC, 2014)

Optimizing prices in descending clock auctions. - Tri-Dung Nguyen; Tuomas Sandholm (EC, 2014)

Power napping with loud neighbors: optimal energy-constrained jamming and anti-jamming. - Bruce DeBruhl; Christian Kroer; Anupam Datta; Tuomas Sandholm; Patrick Tague (WISEC, 2014)

Extensive-Form Game Imperfect-Recall Abstractions With Bounds. - Christian Kroer; Tuomas Sandholm (CoRR, 2014)

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

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 (AAAI Workshop: Computer Poker and Imperfect Information, 2015)

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

Endgame Solving in Large Imperfect-Information Games. - Sam Ganzfried; Tuomas Sandholm (AAAI Workshop: Computer Poker and Imperfect Information, 2015)

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

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

Abstraction for Solving Large Incomplete-Information Games. - Tuomas Sandholm (AAAI, 2015)

Discretization of Continuous Action Spaces in Extensive-Form Games. - Christian Kroer; Tuomas Sandholm (AAMAS, 2015)

Computational Bundling for Auctions. - Christian Kroer; Tuomas Sandholm (AAMAS, 2015)

Simultaneous Abstraction and Equilibrium Finding in Games. - Noam Brown; Tuomas Sandholm (IJCAI, 2015)

Regret-Based Pruning in Extensive-Form Games. - Noam Brown; Tuomas Sandholm (NIPS, 2015)

Faster First-Order Methods for Extensive-Form Game Solving. - Christian Kroer; Kevin Waugh; Fatma Kilinç-Karzan; Tuomas Sandholm (EC, 2015)

Automated Design of Revenue-Maximizing Combinatorial Auctions. - Tuomas Sandholm; Anton Likhodedov (Oper. Res., 2015)

Safe Opponent Exploitation. - Sam Ganzfried; Tuomas Sandholm (ACM Trans. Economics and Comput., 2015)

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

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

Exclusion Method for Finding Nash Equilibrium in Multi-Player Games: (Extended Abstract). - Kimmo Berg; Tuomas Sandholm (AAMAS, 2016)

Multi-Option Descending Clock Auction: (Extended Abstract). - Tri-Dung Nguyen; Tuomas Sandholm (AAMAS, 2016)

Baby Tartanian8: Winning Agent from the 2016 Annual Computer Poker Competition. - Noam Brown; Tuomas Sandholm (IJCAI, 2016)

Sequential Planning for Steering Immune System Adaptation. - Christian Kroer; Tuomas Sandholm (IJCAI, 2016)

Scalable Segment Abstraction Method for Advertising Campaign Admission and Inventory Allocation Optimization. - Fei Peng; Tuomas Sandholm (IJCAI, 2016)

Sample Complexity of Automated Mechanism Design. - Maria-Florina Balcan; Tuomas Sandholm; Ellen Vitercik (NIPS, 2016)

Position-Indexed Formulations for Kidney Exchange. - John P. Dickerson; David F. Manlove; Benjamin Plaut; Tuomas Sandholm; James Trimble 001 (EC, 2016)

Imperfect-Recall Abstractions with Bounds in Games. - Christian Kroer; Tuomas Sandholm (EC, 2016)

Efficiency and Budget Balance. - Swaprava Nath; Tuomas Sandholm (WINE, 2016)

Hardness of the Pricing Problem for Chains in Barter Exchanges. - Benjamin Plaut; John P. Dickerson; Tuomas Sandholm (CoRR, 2016)

Exclusion Method for Finding Nash Equilibrium in Multiplayer Games. - Kimmo Berg; Tuomas Sandholm (AAAI, 2017)

Dynamic Thresholding and Pruning for Regret Minimization. - Noam Brown; Christian Kroer; Tuomas Sandholm (AAAI, 2017)

Reduced Space and Faster Convergence in Imperfect-Information Games via Regret-Based Pruning. - Noam Brown; Tuomas Sandholm (AAAI Workshops, 2017)

Safe and Nested Endgame Solving for Imperfect-Information Games. - Noam Brown; Tuomas Sandholm (AAAI Workshops, 2017)

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

Inter-Club Kidney Exchange. - Gabriele Farina; John P. Dickerson; Tuomas Sandholm (AAAI Workshops, 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 (ICML, 2017)

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

Operation Frames and Clubs in Kidney Exchange. - Gabriele Farina; John P. Dickerson; 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, 2017)

Safe and Nested Subgame Solving for Imperfect-Information Games. - Noam Brown; Tuomas Sandholm (NIPS, 2017)

Theoretical and Practical Advances on Smoothing for Extensive-Form Games. - Christian Kroer; Kevin Waugh; Fatma Kilinç-Karzan; Tuomas Sandholm (EC, 2017)

Sample Complexity of Multi-Item Profit Maximization. - Maria-Florina Balcan; Tuomas Sandholm; Ellen Vitercik (CoRR, 2017)

Multi-Organ Exchange. - John P. Dickerson; Tuomas Sandholm (J. Artif. Intell. Res., 2017)

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

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

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

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

Practical exact algorithm for trembling-hand equilibrium refinements in games. - Gabriele Farina; Nicola Gatti 001; Tuomas Sandholm (NeurIPS, 2018)

Ex ante coordination and collusion in zero-sum multi-player extensive-form games. - Gabriele Farina; Andrea Celli; Nicola Gatti 001; Tuomas Sandholm (NeurIPS, 2018)

Solving Large Sequential Games with the Excessive Gap Technique. - Christian Kroer; Gabriele Farina; Tuomas Sandholm (NeurIPS, 2018)

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

A General Theory of Sample Complexity for Multi-Item Profit Maximization. - Maria-Florina Balcan; Tuomas Sandholm; Ellen Vitercik (EC, 2018)

Composability of Regret Minimizers. - Gabriele Farina; Christian Kroer; Tuomas Sandholm (CoRR, 2018)

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

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

Quasi-Perfect Stackelberg Equilibrium. - Alberto Marchesi 001; Gabriele Farina; Christian Kroer; Nicola Gatti 001; Tuomas Sandholm (AAAI, 2019)

Estimating Approximate Incentive Compatibility. - Maria-Florina Balcan; Tuomas Sandholm; Ellen Vitercik (EC, 2019)

Deep Counterfactual Regret Minimization. - Noam Brown; Adam Lerer; Sam Gross; Tuomas Sandholm (ICML, 2019)

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

Regret Circuits: Composability of Regret Minimizers. - Gabriele Farina; Christian Kroer; Tuomas Sandholm (ICML, 2019)

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

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

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

Efficiency and budget balance in general quasi-linear domains. - Swaprava Nath; Tuomas Sandholm (Games Econ. Behav., 2019)

Failure-Aware Kidney Exchange. - John P. Dickerson; Ariel D. Procaccia; Tuomas Sandholm (Manag. Sci., 2019)

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

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

Refined bounds for algorithm configuration: The knife-edge of dual class approximability. - Maria-Florina Balcan; Tuomas Sandholm; Ellen Vitercik (ICML, 2020)

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

Sparsified Linear Programming for Zero-Sum Equilibrium Finding. - Brian Hu Zhang; Tuomas Sandholm (ICML, 2020)

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

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

Improving Policy-Constrained Kidney Exchange via Pre-Screening. - Duncan C. McElfresh; Michael J. Curry; Tuomas Sandholm; John Dickerson 001 (NeurIPS, 2020)

Small Nash Equilibrium Certificates in Very Large Games. - Brian Hu Zhang; Tuomas Sandholm (NeurIPS, 2020)

Limited lookahead in imperfect-information games. - Christian Kroer; Tuomas Sandholm (Artif. Intell., 2020)

Efficient exploration of zero-sum stochastic games. - Carlos Martin 001; Tuomas Sandholm (CoRR, 2020)

Faster Algorithms for Optimal Ex-Ante Coordinated Collusive Strategies in Extensive-Form Zero-Sum Games. - Gabriele Farina; Andrea Celli; Nicola Gatti 001; Tuomas Sandholm (CoRR, 2020)

Strong Nash equilibria and mixed strategies. - Eleonora Braggion; Nicola Gatti 001; Roberto Lucchetti; Tuomas Sandholm; Bernhard von Stengel (Int. J. Game Theory, 2020)

Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries. - Avrim Blum; John P. Dickerson; Nika Haghtalab; Ariel D. Procaccia; Tuomas Sandholm; Ankit Sharma 001 (Oper. Res., 2020)

Faster algorithms for extensive-form game solving via improved smoothing functions. - Christian Kroer; Kevin Waugh; Fatma Kilinç-Karzan; Tuomas Sandholm (Math. Program., 2020)

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

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

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

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

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

Connecting Optimal Ex-Ante Collusion in Teams to Extensive-Form Correlation: Faster Algorithms and Positive Complexity Results. - Gabriele Farina; Andrea Celli; Nicola Gatti 001; Tuomas Sandholm (ICML, 2021)

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

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

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

Subgame solving without common knowledge. - Brian Hu Zhang; Tuomas Sandholm (NeurIPS, 2021)

Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria. - Gabriele Farina; Christian Kroer; Tuomas Sandholm (EC, 2021)

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 (STOC, 2021)

Efficient Decentralized Learning Dynamics for Extensive-Form Coarse Correlated Equilibrium: No Expensive Computation of Stationary Distributions Required. - Gabriele Farina; Andrea Celli; Tuomas Sandholm (CoRR, 2021)

Improved Learning Bounds for Branch-and-Cut. - Maria-Florina Balcan; Siddharth Prasad; Tuomas Sandholm; Ellen Vitercik (CoRR, 2021)

Combination treatment optimization using a pan-cancer pathway model. - Robin Schmucker; Gabriele Farina; James R. Faeder; Fabian Fröhlich; Ali Sinan Saglam; Tuomas Sandholm (PLoS Comput. Biol., 2021)

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

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

Improved Sample Complexity Bounds for Branch-And-Cut. - Maria-Florina Balcan; Siddharth Prasad; Tuomas Sandholm; Ellen Vitercik (CP, 2022)

On Last-Iterate Convergence Beyond Zero-Sum Games. - Ioannis Anagnostides; Ioannis Panageas; Gabriele Farina; Tuomas Sandholm (ICML, 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 (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)

Maximizing Revenue under Market Shrinkage and Market Uncertainty. - Maria-Florina Balcan; Siddharth Prasad; Tuomas Sandholm (NeurIPS, 2022)

Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts. - Maria-Florina Balcan; Siddharth Prasad; Tuomas Sandholm; Ellen Vitercik (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 (NeurIPS, 2022)

Subgame Solving in Adversarial Team Games. - Brian Hu Zhang; Luca Carminati; Federico Cacciamani; Gabriele Farina; Pierriccardo Olivieri; Nicola Gatti 001; Tuomas Sandholm (NeurIPS, 2022)

Polynomial-Time Optimal Equilibria with a Mediator in Extensive-Form Games. - Brian Hu Zhang; Tuomas Sandholm (NeurIPS, 2022)

Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria. - Ioannis Anagnostides; Gabriele Farina; Christian Kroer; Andrea Celli; Tuomas Sandholm (EC, 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 (EC, 2022)

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 (STOC, 2022)

Anytime PSRO for Two-Player Zero-Sum Games. - Stephen McAleer; Kevin Wang 003; John B. Lanier; Marc Lanctot; Pierre Baldi; Tuomas Sandholm; Roy Fox (CoRR, 2022)

Team Belief DAG Form: A Concise Representation for Team-Correlated Game-Theoretic Decision Making. - Brian Hu Zhang; Gabriele Farina; Tuomas Sandholm (CoRR, 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 (CoRR, 2022)

Near-Optimal No-Regret Learning for General Convex Games. - Gabriele Farina; Ioannis Anagnostides; Haipeng Luo; Chung-Wei Lee; Christian Kroer; Tuomas Sandholm (CoRR, 2022)

Self-Play PSRO: Toward Optimal Populations in Two-Player Zero-Sum Games. - Stephen McAleer; John B. Lanier; Kevin A. Wang; Pierre Baldi; Roy Fox; Tuomas Sandholm (CoRR, 2022)

Meta-Learning in Games. - Keegan Harris; Ioannis Anagnostides; Gabriele Farina; Mikhail Khodak; Steven Wu 001; Tuomas Sandholm (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 (ICLR, 2023)

Near-Optimal Φ-Regret Learning in Extensive-Form Games. - Ioannis Anagnostides; Gabriele Farina; 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 (ICML, 2023)

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

Finding Mixed-Strategy Equilibria of Continuous-Action Games without Gradients Using Randomized Policy Networks. - Carlos Martin 001; Tuomas Sandholm (IJCAI, 2023)

Optimal Anytime Coalition Structure Generation Utilizing Compact Solution Space Representation. - Redha Taguelmimt; Samir Aknine; Djamila Boukredera; Narayan Changder; Tuomas Sandholm (IJCAI, 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 (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 001; Tuomas Sandholm (NeurIPS, 2023)

Bicriteria Multidimensional Mechanism Design with Side Information. - Siddharth Prasad; Maria-Florina Balcan; Tuomas Sandholm (NeurIPS, 2023)

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

Computing equilibria by minimizing exploitability with best-response ensembles. - Carlos Martin 001; Tuomas Sandholm (CoRR, 2023)

Steering No-Regret Learners to Optimal Equilibria. - Brian Hu Zhang; Gabriele Farina; Ioannis Anagnostides; Federico Cacciamani; Stephen Marcus McAleer; Andreas Alexander Haupt; Andrea Celli; Nicola Gatti 001; Vincent Conitzer; Tuomas Sandholm (CoRR, 2023)

Game-Theoretic Robust Reinforcement Learning Handles Temporally-Coupled Perturbations. - Yongyuan Liang; Yanchao Sun; Ruijie Zheng; Xiangyu Liu; Tuomas Sandholm; Furong Huang; Stephen McAleer (CoRR, 2023)

Planning in the imagination: High-level planning on learned abstract search spaces. - Carlos Martin 001; Tuomas Sandholm (CoRR, 2023)

Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Extensive-Form Games. - Brian Hu Zhang; Gabriele Farina; Tuomas Sandholm (CoRR, 2023)

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 (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 (AAAI, 2024)

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

Efficient Size-based Hybrid Algorithm for Optimal Coalition Structure Generation. - Redha Taguelmimt; Samir Aknine; Djamila Boukredera; Narayan Changder; Tuomas Sandholm (AAMAS, 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 (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 (ICLR, 2024)

Confronting Reward Model Overoptimization with Constrained RLHF. - Ted Moskovitz; Aaditya K. Singh; DJ Strouse; Tuomas Sandholm; Ruslan Salakhutdinov; Anca D. Dragan; Stephen Marcus McAleer (ICLR, 2024)

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

Scalable Mechanism Design for Multi-Agent Path Finding. - Paul Friedrich 001; Yulun Zhang 002; Michael J. Curry; Ludwig Dierks; Stephen McAleer; Jiaoyang Li 001; Tuomas Sandholm; Sven Seuken (IJCAI, 2024)

Model-Free Preference Elicitation. - Carlos Martin 001; Craig Boutilier; Ofer Meshi; 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 (IJCAI, 2024)

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

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

On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games. - Ioannis Anagnostides; Alkis Kalavasis; Tuomas Sandholm; Manolis Zampetakis (ITCS, 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 (NeurIPS, 2024)

Hidden-Role Games: Equilibrium Concepts and Computation. - Luca Carminati; Brian Hu Zhang; Gabriele Farina; Nicola Gatti 001; Tuomas Sandholm (EC, 2024)

Steering No-Regret Learners to a Desired Equilibrium. - Brian Hu Zhang; Gabriele Farina; Ioannis Anagnostides; Federico Cacciamani; Stephen McAleer; Andreas A. Haupt; Andrea Celli; Nicola Gatti 001; Vincent Conitzer; Tuomas Sandholm (EC, 2024)

New Sequence-Independent Lifting Techniques for Cutting Planes and When They Induce Facets. - Siddharth Prasad; Ellen Vitercik; Maria-Florina Balcan; Tuomas Sandholm (CoRR, 2024)

Efficient Φ-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games. - Brian Hu Zhang; Ioannis Anagnostides; Gabriele Farina; Tuomas Sandholm (CoRR, 2024)

Faster Game Solving via Hyperparameter Schedules. - Naifeng Zhang; Stephen McAleer; Tuomas Sandholm (CoRR, 2024)

Simultaneous incremental support adjustment and metagame solving: An equilibrium-finding framework for continuous-action games. - Carlos Martin 001; Tuomas Sandholm (CoRR, 2024)

A Lower Bound on Swap Regret in Extensive-Form Games. - Constantinos Daskalakis; Gabriele Farina; Noah Golowich; Tuomas Sandholm; Brian Hu Zhang (CoRR, 2024)

Joint-perturbation simultaneous pseudo-gradient. - Carlos Martin 001; Tuomas Sandholm (CoRR, 2024)

Verifying Approximate Equilibrium in Auctions. - Fabian R. Pieroth; Tuomas Sandholm (CoRR, 2024)

Convergence of log(1/ε) for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis. - Ioannis Anagnostides; Tuomas Sandholm (CoRR, 2024)

Barriers to Welfare Maximization with No-Regret Learning. - Ioannis Anagnostides; Alkis Kalavasis; Tuomas Sandholm (CoRR, 2024)

Computational Lower Bounds for Regret Minimization in Normal-Form Games. - Ioannis Anagnostides; Alkis Kalavasis; Tuomas Sandholm (CoRR, 2024)

Learning to Branch: Generalization Guarantees and Limits of Data-Independent Discretization. - Maria-Florina Balcan; Travis Dick; Tuomas Sandholm; Ellen Vitercik (J. ACM, 2024)

How Much Data Is Sufficient to Learn High-Performing Algorithms? - Maria-Florina Balcan; Dan F. DeBlasio; Travis Dick; Carl Kingsford; Tuomas Sandholm; Ellen Vitercik (J. ACM, 2024)

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

The Value of Recall in Extensive-Form Games. - Ratip Emin Berker; Emanuel Tewolde; Ioannis Anagnostides; Tuomas Sandholm; Vincent Conitzer (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 (AAAI, 2025)

ApproxED: Approximate Exploitability Descent via Learned Best Responses. - Carlos Martin 001; Tuomas Sandholm (AAMAS, 2025)

AlphaZeroES: Direct Score Maximization Outperforms Planning Loss Minimization. - Carlos Martin 001; Tuomas Sandholm (AAMAS, 2025)

Learning and Computation of Φ-Equilibria at the Frontier of Tractability. - Brian Hu Zhang; Ioannis Anagnostides; Emanuel Tewolde; Ratip Emin Berker; Gabriele Farina; Vincent Conitzer; Tuomas Sandholm (EC, 2025)

Computational Lower Bounds for No-Regret Learning in Normal-Form Games. - Ioannis Anagnostides; Alkis Kalavasis; Tuomas Sandholm (STOC, 2025)

Generalization Guarantees for Multi-Item Profit Maximization: Pricing, Auctions, and Randomized Mechanisms. - Maria-Florina Balcan; Tuomas Sandholm; Ellen Vitercik (Oper. Res., 2025)

Solving Infinite-Player Games with Player-to-Strategy Networks. - Carlos Martin 001; Tuomas Sandholm (CoRR, 2025)

The Power of Perturbation under Sampling in Solving Extensive-Form Games. - Wataru Masaka; Mitsuki Sakamoto; Kenshi Abe; Kaito Ariu; Tuomas Sandholm; Atsushi Iwasaki (CoRR, 2025)

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

Expected Variational Inequalities. - Brian Hu Zhang; Ioannis Anagnostides; Emanuel Tewolde; Ratip Emin Berker; Gabriele Farina; Vincent Conitzer; Tuomas Sandholm (CoRR, 2025)

Learning a Game by Paying the Agents. - Brian Hu Zhang; Tao Lin; Yiling Chen; Tuomas Sandholm (CoRR, 2025)

A Polynomial-Time Algorithm for Variational Inequalities under the Minty Condition. - Ioannis Anagnostides; Gabriele Farina; Tuomas Sandholm; Brian Hu Zhang (CoRR, 2025)

Weakest Bidder Types and New Core-Selecting Combinatorial Auctions. - Siddharth Prasad; Maria-Florina Balcan; Tuomas Sandholm (CoRR, 2025)

Revenue-Optimal Efficient Mechanism Design with General Type Spaces. - Siddharth Prasad; Maria-Florina Balcan; Tuomas Sandholm (CoRR, 2025)

General search techniques without common knowledge for imperfect-information games, and application to superhuman Fog of War chess. - Brian Hu Zhang; Tuomas Sandholm (CoRR, 2025)