Tuomas Sandholm

550 papers A* 212A 55B 6C 4Journal 200Unranked 71

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	(Doubly) Exponential Lower Bounds for Follow the Regularized Leader in Potential Games. CoRR Ioannis Anagnostides, Ioannis Panageas, Nikolas Patris, Tuomas Sandholm
2026	J	`jnl`	Decision Making under Imperfect Recall: Algorithms and Benchmarks. CoRR Emanuel Tewolde, Brian Hu Zhang, Ioannis Anagnostides, Tuomas Sandholm, Vincent Conitzer
2026	J	`jnl`	Efficient representations for team and imperfect-recall equilibrium computation. Artif. Intell. Luca Carminati, Brian Hu Zhang, Federico Cacciamani, Junkang Li, Gabriele Farina, Nicola Gatti, Tuomas Sandholm
2026	J	`jnl`	Equilibrium Refinements Improve Subgame Solving in Imperfect-Information Games. CoRR Ondrej Kubícek, Viliam Lisý, Tuomas Sandholm
2026	A*	`conf`	Faster Game Solving via Hyperparameter Schedules. AAAI Naifeng Zhang, Stephen Marcus McAleer, Tuomas Sandholm
2026	J	`jnl`	Learning Potentials for Dynamic Matching and Application to Heart Transplantation. CoRR Itai Zilberstein, Ioannis Anagnostides, Zachary W. Sollie, Arman Kilic, Tuomas Sandholm
2026	J	`jnl`	Near-Optimal Dynamic Matching via Coarsening with Application to Heart Transplantation. CoRR Itai Zilberstein, Ioannis Anagnostides, Zachary W. Sollie, Arman Kilic, Tuomas Sandholm
2026	J	`jnl`	On the Computational Complexity of Performative Prediction. CoRR Ioannis Anagnostides, Rohan Chauhan, Ioannis Panageas, Tuomas Sandholm, Jingming Yan
2026	J	`jnl`	Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation. Math. Oper. Res. Brian Hu Zhang, Gabriele Farina, Andrea Celli, Tuomas Sandholm
2026	J	`jnl`	Position: Machine Learning for Heart Transplant Allocation Policy Optimization Should Account for Incentives. CoRR Ioannis Anagnostides, Itai Zilberstein, Zachary W. Sollie, Arman Kilic, Tuomas Sandholm
2026	J	`jnl`	The Complexity of Proper Equilibrium in Extensive-Form and Polytope Games. CoRR Brian Hu Zhang, Ioannis Anagnostides, Kiriaki Fragkia, Maria-Florina Balcan, Tuomas Sandholm
2026	A*	`conf`	Weakest Bidder Types and New Core-Selecting Combinatorial Auctions. AAAI Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm
2025	A*	`conf`	A Multiagent Path Search Algorithm for Large-Scale Coalition Structure Generation. AAAI Redha Taguelmimt, Samir Aknine, Djamila Boukredera, Narayan Changder, Tuomas Sandholm
2025	J	`jnl`	A Multiagent Path Search Algorithm for Large-Scale Coalition Structure Generation. CoRR Redha Taguelmimt, Samir Aknine, Djamila Boukredera, Narayan Changder, Tuomas Sandholm
2025	J	`jnl`	A Polynomial-Time Algorithm for Variational Inequalities under the Minty Condition. CoRR Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm, Brian Hu Zhang
2025	A	`conf`	AlphaZeroES: Direct Score Maximization Outperforms Planning Loss Minimization. AAMAS Carlos Martin, Tuomas Sandholm
2025	A	`conf`	ApproxED: Approximate Exploitability Descent via Learned Best Responses. AAMAS Carlos Martin, Tuomas Sandholm
2025	J	`jnl`	Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria. Oper. Res. Gabriele Farina, Christian Kroer, Tuomas Sandholm
2025	A*	`conf`	Computational Lower Bounds for No-Regret Learning in Normal-Form Games. STOC Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm
2025	A*	`conf`	Computing Game Symmetries and Equilibria That Respect Them. AAAI Emanuel Tewolde, Brian Hu Zhang, Caspar Oesterheld, Tuomas Sandholm, Vincent Conitzer
2025	J	`jnl`	Computing Game Symmetries and Equilibria That Respect Them. CoRR Emanuel Tewolde, Brian Hu Zhang, Caspar Oesterheld, Tuomas Sandholm, Vincent Conitzer
2025	J	`jnl`	Convergence of Regret Matching in Potential Games and Constrained Optimization. CoRR Ioannis Anagnostides, Emanuel Tewolde, Brian Hu Zhang, Ioannis Panageas, Vincent Conitzer, Tuomas Sandholm
2025	A*	`conf`	Expected Variational Inequalities. ICML Brian Hu Zhang, Ioannis Anagnostides, Emanuel Tewolde, Ratip Emin Berker, Gabriele Farina, Vincent Conitzer, Tuomas Sandholm
2025	J	`jnl`	Expected Variational Inequalities. CoRR Brian Hu Zhang, Ioannis Anagnostides, Emanuel Tewolde, Ratip Emin Berker, Gabriele Farina, Vincent Conitzer, Tuomas Sandholm
2025	J	`jnl`	General search techniques without common knowledge for imperfect-information games, and application to superhuman Fog of War chess. CoRR Brian Hu Zhang, Tuomas Sandholm
2025	J	`jnl`	Generalization Guarantees for Multi-Item Profit Maximization: Pricing, Auctions, and Randomized Mechanisms. Oper. Res. Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik
2025	A*	`conf`	Increasing Revenue in Efficient Combinatorial Auctions by Learning to Generate Artificial Competition. AAAI Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm
2025	A*	`conf`	Joint-Perturbation Simultaneous Pseudo-Gradient. IJCAI Carlos Martin, Tuomas Sandholm
2025	J	`jnl`	Learning a Game by Paying the Agents. CoRR Brian Hu Zhang, Tao Lin, Yiling Chen, Tuomas Sandholm
2025	A*	`conf`	Learning and Computation of Φ-Equilibria at the Frontier of Tractability. EC Brian Hu Zhang, Ioannis Anagnostides, Emanuel Tewolde, Ratip Emin Berker, Gabriele Farina, Vincent Conitzer, Tuomas Sandholm
2025	J	`jnl`	Learning and Computation of Φ-Equilibria at the Frontier of Tractability. CoRR Brian Hu Zhang, Ioannis Anagnostides, Emanuel Tewolde, Ratip Emin Berker, Gabriele Farina, Vincent Conitzer, Tuomas Sandholm
2025	A*	`conf`	New Sequence-Independent Lifting Techniques for Cover Inequalities and When They Induce Facets. IJCAI Siddharth Prasad, Ellen Vitercik, Maria-Florina Balcan, Tuomas Sandholm
2025	J	`jnl`	Policy Optimization for Dynamic Heart Transplant Allocation. CoRR Ioannis Anagnostides, Zachary W. Sollie, Arman Kilic, Tuomas Sandholm
2025	J	`jnl`	Revenue-Optimal Efficient Mechanism Design with General Type Spaces. CoRR Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm
2025	J	`jnl`	Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games. CoRR Brian Hu Zhang, Ioannis Anagnostides, Tuomas Sandholm
2025	J	`jnl`	Solving Infinite-Player Games with Player-to-Strategy Networks. CoRR Carlos Martin, Tuomas Sandholm
2025	J	`jnl`	The Complexity of Equilibrium Refinements in Potential Games. CoRR Ioannis Anagnostides, Maria-Florina Balcan, Kiriaki Fragkia, Tuomas Sandholm, Emanuel Tewolde, Brian Hu Zhang
2025	J	`jnl`	The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games. CoRR Ioannis Anagnostides, Ioannis Panageas, Tuomas Sandholm, Jingming Yan
2025	J	`jnl`	The Power of Perturbation under Sampling in Solving Extensive-Form Games. CoRR Wataru Masaka, Mitsuki Sakamoto, Kenshi Abe, Kaito Ariu, Tuomas Sandholm, Atsushi Iwasaki
2025	A*	`conf`	The Value of Recall in Extensive-Form Games. AAAI Ratip Emin Berker, Emanuel Tewolde, Ioannis Anagnostides, Tuomas Sandholm, Vincent Conitzer
2025	J	`jnl`	Weakest Bidder Types and New Core-Selecting Combinatorial Auctions. CoRR Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm
2024	J	`jnl`	A Lower Bound on Swap Regret in Extensive-Form Games. CoRR Constantinos Daskalakis, Gabriele Farina, Noah Golowich, Tuomas Sandholm, Brian Hu Zhang
2024	A	`conf`	A Multiagent Path Search Algorithm for Large-Scale Coalition Structure Generation. AAMAS Redha Taguelmimt, Samir Aknine, Djamila Boukredera, Narayan Changder, Tuomas Sandholm
2024	J	`jnl`	AlphaZeroES: Direct score maximization outperforms planning loss minimization. CoRR Carlos Martin, Tuomas Sandholm
2024	A*	`conf`	Automated Design of Affine Maximizer Mechanisms in Dynamic Settings. AAAI Michael J. Curry, Vinzenz Thoma, Darshan Chakrabarti, Stephen McAleer, Christian Kroer, Tuomas Sandholm, Niao He, Sven Seuken
2024	J	`jnl`	Automated Design of Affine Maximizer Mechanisms in Dynamic Settings. CoRR Michael J. Curry, Vinzenz Thoma, Darshan Chakrabarti, Stephen McAleer, Christian Kroer, Tuomas Sandholm, Niao He, Sven Seuken
2024	J	`jnl`	Barriers to Welfare Maximization with No-Regret Learning. CoRR Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm
2024	J	`jnl`	Computational Lower Bounds for Regret Minimization in Normal-Form Games. CoRR Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm
2024	A*	`conf`	Confronting Reward Model Overoptimization with Constrained RLHF. ICLR Ted Moskovitz, Aaditya K. Singh, DJ Strouse, Tuomas Sandholm, Ruslan Salakhutdinov, Anca D. Dragan, Stephen Marcus McAleer
2024	A*	`conf`	Convergence of $\text{log}(1/\epsilon)$ for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis. NeurIPS Ioannis Anagnostides, Tuomas Sandholm
2024	J	`jnl`	Convergence of log(1/ε) for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis. CoRR Ioannis Anagnostides, Tuomas Sandholm
2024	A*	`conf`	Efficient $\Phi$-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games. NeurIPS Brian Hu Zhang, Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm
2024	A	`conf`	Efficient Size-based Hybrid Algorithm for Optimal Coalition Structure Generation. AAMAS Redha Taguelmimt, Samir Aknine, Djamila Boukredera, Narayan Changder, Tuomas Sandholm
2024	J	`jnl`	Efficient Φ-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games. CoRR Brian Hu Zhang, Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm
2024	A*	`conf`	Exponential Lower Bounds on the Double Oracle Algorithm in Zero-Sum Games. IJCAI Brian Hu Zhang, Tuomas Sandholm
2024	J	`jnl`	Exponential Lower Bounds on the Double Oracle Algorithm in Zero-Sum Games. CoRR Brian Hu Zhang, Tuomas Sandholm
2024	J	`jnl`	Faster Game Solving via Hyperparameter Schedules. CoRR Naifeng Zhang, Stephen McAleer, Tuomas Sandholm
2024	A*	`conf`	Faster Optimal Coalition Structure Generation via Offline Coalition Selection and Graph-Based Search. IJCAI Redha Taguelmimt, Samir Aknine, Djamila Boukredera, Narayan Changder, Tuomas Sandholm
2024	J	`jnl`	Faster Optimal Coalition Structure Generation via Offline Coalition Selection and Graph-Based Search. CoRR Redha Taguelmimt, Samir Aknine, Djamila Boukredera, Narayan Changder, Tuomas Sandholm
2024	A*	`conf`	Game-Theoretic Robust Reinforcement Learning Handles Temporally-Coupled Perturbations. ICLR Yongyuan Liang, Yanchao Sun, Ruijie Zheng, Xiangyu Liu, Benjamin Eysenbach, Tuomas Sandholm, Furong Huang, Stephen Marcus McAleer
2024	A*	`conf`	Hidden-Role Games: Equilibrium Concepts and Computation. EC Luca Carminati, Brian Hu Zhang, Gabriele Farina, Nicola Gatti, Tuomas Sandholm
2024	J	`jnl`	How Much Data Is Sufficient to Learn High-Performing Algorithms? J. ACM Maria-Florina Balcan, Dan F. DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, Ellen Vitercik
2024	A*	`conf`	Imperfect-Recall Games: Equilibrium Concepts and Their Complexity. IJCAI Emanuel Tewolde, Brian Hu Zhang, Caspar Oesterheld, Manolis Zampetakis, Tuomas Sandholm, Paul Goldberg, Vincent Conitzer
2024	J	`jnl`	Imperfect-Recall Games: Equilibrium Concepts and Their Complexity. CoRR Emanuel Tewolde, Brian Hu Zhang, Caspar Oesterheld, Manolis Zampetakis, Tuomas Sandholm, Paul W. Goldberg, Vincent Conitzer
2024	J	`jnl`	Joint-perturbation simultaneous pseudo-gradient. CoRR Carlos Martin, Tuomas Sandholm
2024	J	`jnl`	Learning to Branch: Generalization Guarantees and Limits of Data-Independent Discretization. J. ACM Maria-Florina Balcan, Travis Dick, Tuomas Sandholm, Ellen Vitercik
2024	A*	`conf`	Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Sequential Games. ICLR Brian Hu Zhang, Gabriele Farina, Tuomas Sandholm
2024	A*	`conf`	Model-Free Preference Elicitation. IJCAI Carlos Martin, Craig Boutilier, Ofer Meshi, Tuomas Sandholm
2024	J	`jnl`	New Sequence-Independent Lifting Techniques for Cutting Planes and When They Induce Facets. CoRR Siddharth Prasad, Ellen Vitercik, Maria-Florina Balcan, Tuomas Sandholm
2024	A	`conf`	On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games. ITCS Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, Manolis Zampetakis
2024	A*	`conf`	On the Outcome Equivalence of Extensive-Form and Behavioral Correlated Equilibria. AAAI Brian Hu Zhang, Tuomas Sandholm
2024	J	`jnl`	On the Outcome Equivalence of Extensive-Form and Behavioral Correlated Equilibria. CoRR Brian Hu Zhang, Tuomas Sandholm
2024	A*	`conf`	Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property. AAAI Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
2024	A*	`conf`	Scalable Mechanism Design for Multi-Agent Path Finding. IJCAI Paul Friedrich, Yulun Zhang, Michael J. Curry, Ludwig Dierks, Stephen McAleer, Jiaoyang Li, Tuomas Sandholm, Sven Seuken
2024	J	`jnl`	Scalable Mechanism Design for Multi-Agent Path Finding. CoRR Paul Friedrich, Yulun Zhang, Michael J. Curry, Ludwig Dierks, Stephen McAleer, Jiaoyang Li, Tuomas Sandholm, Sven Seuken
2024	J	`jnl`	Simultaneous incremental support adjustment and metagame solving: An equilibrium-finding framework for continuous-action games. CoRR Carlos Martin, Tuomas Sandholm
2024	A*	`conf`	Steering No-Regret Learners to a Desired Equilibrium. EC Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen McAleer, Andreas A. Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm
2024	J	`jnl`	The Value of Recall in Extensive-Form Games. CoRR Ratip Emin Berker, Emanuel Tewolde, Ioannis Anagnostides, Tuomas Sandholm, Vincent Conitzer
2024	A*	`conf`	Toward Optimal Policy Population Growth in Two-Player Zero-Sum Games. ICLR Stephen Marcus McAleer, JB Lanier, Kevin A. Wang, Pierre Baldi, Tuomas Sandholm, Roy Fox
2024	J	`jnl`	Verifying Approximate Equilibrium in Auctions. CoRR Fabian R. Pieroth, Tuomas Sandholm
2023	A*	`conf`	Bicriteria Multidimensional Mechanism Design with Side Information. NeurIPS Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm
2023	J	`jnl`	Bicriteria Multidimensional Mechanism Design with Side Information. CoRR Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm
2023	A*	`conf`	Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games. NeurIPS Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen McAleer, Andreas A. Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm
2023	J	`jnl`	Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games. CoRR Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen Marcus McAleer, Andreas Alexander Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm
2023	J	`jnl`	Computing equilibria by minimizing exploitability with best-response ensembles. CoRR Carlos Martin, Tuomas Sandholm
2023	J	`jnl`	Confronting Reward Model Overoptimization with Constrained RLHF. CoRR Ted Moskovitz, Aaditya K. Singh, DJ Strouse, Tuomas Sandholm, Ruslan Salakhutdinov, Anca D. Dragan, Stephen McAleer
2023	A*	`conf`	Differentiable Economics for Randomized Affine Maximizer Auctions. IJCAI Michael J. Curry, Tuomas Sandholm, John P. Dickerson
2023	A*	`conf`	ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret. ICLR Stephen Marcus McAleer, Gabriele Farina, Marc Lanctot, Tuomas Sandholm
2023	A*	`conf`	Finding Mixed-Strategy Equilibria of Continuous-Action Games without Gradients Using Randomized Policy Networks. IJCAI Carlos Martin, Tuomas Sandholm
2023	J	`jnl`	Game-Theoretic Robust Reinforcement Learning Handles Temporally-Coupled Perturbations. CoRR Yongyuan Liang, Yanchao Sun, Ruijie Zheng, Xiangyu Liu, Tuomas Sandholm, Furong Huang, Stephen McAleer
2023	J	`jnl`	Hidden-Role Games: Equilibrium Concepts and Computation. CoRR Luca Carminati, Brian Hu Zhang, Gabriele Farina, Nicola Gatti, Tuomas Sandholm
2023	J	`jnl`	Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Extensive-Form Games. CoRR Brian Hu Zhang, Gabriele Farina, Tuomas Sandholm
2023	A*	`conf`	Meta-Learning in Games. ICLR Keegan Harris, Ioannis Anagnostides, Gabriele Farina, Mikhail Khodak, Steven Wu, Tuomas Sandholm
2023	A*	`conf`	Near-Optimal Φ-Regret Learning in Extensive-Form Games. ICML Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm
2023	J	`jnl`	On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games. CoRR Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, Manolis Zampetakis
2023	A*	`conf`	On the Convergence of No-Regret Learning Dynamics in Time-Varying Games. NeurIPS Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
2023	J	`jnl`	On the Convergence of No-Regret Learning Dynamics in Time-Varying Games. CoRR Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
2023	A*	`conf`	On the Interplay between Social Welfare and Tractability of Equilibria. NeurIPS Ioannis Anagnostides, Tuomas Sandholm
2023	J	`jnl`	On the Interplay between Social Welfare and Tractability of Equilibria. CoRR Ioannis Anagnostides, Tuomas Sandholm
2023	A*	`conf`	Optimal Anytime Coalition Structure Generation Utilizing Compact Solution Space Representation. IJCAI Redha Taguelmimt, Samir Aknine, Djamila Boukredera, Narayan Changder, Tuomas Sandholm
2023	J	`jnl`	Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence Beyond the Minty Property. CoRR Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
2023	J	`jnl`	Planning in the imagination: High-level planning on learned abstract search spaces. CoRR Carlos Martin, Tuomas Sandholm
2023	J	`jnl`	Steering No-Regret Learners to Optimal Equilibria. CoRR Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen Marcus McAleer, Andreas Alexander Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm
2023	A*	`conf`	Team Belief DAG: Generalizing the Sequence Form to Team Games for Fast Computation of Correlated Team Max-Min Equilibria via Regret Minimization. ICML Brian Hu Zhang, Gabriele Farina, Tuomas Sandholm
2023	A*	`conf`	Team-PSRO for Learning Approximate TMECor in Large Team Games via Cooperative Reinforcement Learning. NeurIPS Stephen McAleer, Gabriele Farina, Gaoyue Zhou, Mingzhi Wang, Yaodong Yang, Tuomas Sandholm
2022	J	`jnl`	Anytime PSRO for Two-Player Zero-Sum Games. CoRR Stephen McAleer, Kevin Wang, John B. Lanier, Marc Lanctot, Pierre Baldi, Tuomas Sandholm, Roy Fox
2022	J	`jnl`	Differentiable Economics for Randomized Affine Maximizer Auctions. CoRR Michael J. Curry, Tuomas Sandholm, John P. Dickerson
2022	J	`jnl`	ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret. CoRR Stephen McAleer, Gabriele Farina, Marc Lanctot, Tuomas Sandholm
2022	A*	`conf`	Fast Payoff Matrix Sparsification Techniques for Structured Extensive-Form Games. AAAI Gabriele Farina, Tuomas Sandholm
2022	A*	`conf`	Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria. EC Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Andrea Celli, Tuomas Sandholm
2022	J	`jnl`	Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria. CoRR Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Andrea Celli, Tuomas Sandholm
2022	J	`jnl`	Finding mixed-strategy equilibria of continuous-action games without gradients using randomized policy networks. CoRR Carlos Martin, Tuomas Sandholm
2022	A	`conf`	Improved Sample Complexity Bounds for Branch-And-Cut. CP Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik
2022	A*	`conf`	Maximizing Revenue under Market Shrinkage and Market Uncertainty. NeurIPS Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm
2022	J	`jnl`	Meta-Learning in Games. CoRR Keegan Harris, Ioannis Anagnostides, Gabriele Farina, Mikhail Khodak, Zhiwei Steven Wu, Tuomas Sandholm
2022	J	`jnl`	Near-Optimal $Φ$-Regret Learning in Extensive-Form Games. CoRR Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm
2022	A*	`conf`	Near-Optimal No-Regret Learning Dynamics for General Convex Games. NeurIPS Gabriele Farina, Ioannis Anagnostides, Haipeng Luo, Chung-wei Lee, Christian Kroer, Tuomas Sandholm
2022	J	`jnl`	Near-Optimal No-Regret Learning for General Convex Games. CoRR Gabriele Farina, Ioannis Anagnostides, Haipeng Luo, Chung-wei Lee, Christian Kroer, Tuomas Sandholm
2022	A*	`conf`	Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games. STOC Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, Tuomas Sandholm
2022	A*	`conf`	On Last-Iterate Convergence Beyond Zero-Sum Games. ICML Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
2022	J	`jnl`	On Last-Iterate Convergence Beyond Zero-Sum Games. CoRR Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
2022	A*	`conf`	Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation. EC Brian Hu Zhang, Gabriele Farina, Andrea Celli, Tuomas Sandholm
2022	J	`jnl`	Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation. CoRR Brian Hu Zhang, Gabriele Farina, Andrea Celli, Tuomas Sandholm
2022	A*	`conf`	Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games. NeurIPS Ioannis Anagnostides, Gabriele Farina, Ioannis Panageas, Tuomas Sandholm
2022	J	`jnl`	Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games. CoRR Ioannis Anagnostides, Gabriele Farina, Ioannis Panageas, Tuomas Sandholm
2022	A*	`conf`	Polynomial-Time Optimal Equilibria with a Mediator in Extensive-Form Games. NeurIPS Brian Hu Zhang, Tuomas Sandholm
2022	J	`jnl`	Polynomial-Time Optimal Equilibria with a Mediator in Extensive-Form Games. CoRR Brian Hu Zhang, Tuomas Sandholm
2022	J	`jnl`	Self-Play PSRO: Toward Optimal Populations in Two-Player Zero-Sum Games. CoRR Stephen McAleer, John B. Lanier, Kevin A. Wang, Pierre Baldi, Roy Fox, Tuomas Sandholm
2022	A*	`conf`	Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts. NeurIPS Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik
2022	J	`jnl`	Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts. CoRR Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik
2022	A*	`conf`	Subgame Solving in Adversarial Team Games. NeurIPS Brian Hu Zhang, Luca Carminati, Federico Cacciamani, Gabriele Farina, Pierriccardo Olivieri, Nicola Gatti, Tuomas Sandholm
2022	J	`jnl`	Team Belief DAG Form: A Concise Representation for Team-Correlated Game-Theoretic Decision Making. CoRR Brian Hu Zhang, Gabriele Farina, Tuomas Sandholm
2022	A*	`conf`	Team Correlated Equilibria in Zero-Sum Extensive-Form Games via Tree Decompositions. AAAI Brian Hu Zhang, Tuomas Sandholm
2022	A*	`conf`	Uncoupled Learning Dynamics with NeurIPS Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Chung-wei Lee, Haipeng Luo, Tuomas Sandholm
2022	J	`jnl`	Uncoupled Learning Dynamics with O(log T) Swap Regret in Multiplayer Games. CoRR Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Chung-wei Lee, Haipeng Luo, Tuomas Sandholm
2021	A*	`conf`	Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games. AAAI Gabriele Farina, Robin Schmucker, Tuomas Sandholm
2021	J	`jnl`	Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games. CoRR Gabriele Farina, Robin Schmucker, Tuomas Sandholm
2021	A*	`conf`	Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria. EC Gabriele Farina, Christian Kroer, Tuomas Sandholm
2021	J	`jnl`	Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria. CoRR Gabriele Farina, Christian Kroer, Tuomas Sandholm
2021	J	`jnl`	Combination treatment optimization using a pan-cancer pathway model. PLoS Comput. Biol. Robin Schmucker, Gabriele Farina, James R. Faeder, Fabian Fröhlich, Ali Sinan Saglam, Tuomas Sandholm
2021	A*	`conf`	Connecting Optimal Ex-Ante Collusion in Teams to Extensive-Form Correlation: Faster Algorithms and Positive Complexity Results. ICML Gabriele Farina, Andrea Celli, Nicola Gatti, Tuomas Sandholm
2021	J	`jnl`	Efficient Decentralized Learning Dynamics for Extensive-Form Coarse Correlated Equilibrium: No Expensive Computation of Stationary Distributions Required. CoRR Gabriele Farina, Andrea Celli, Tuomas Sandholm
2021	A*	`conf`	Equilibrium Refinement for the Age of Machines: The One-Sided Quasi-Perfect Equilibrium. NeurIPS Gabriele Farina, Tuomas Sandholm
2021	J	`jnl`	Fast Payoff Matrix Sparsification Techniques for Structured Extensive-Form Games. CoRR Gabriele Farina, Tuomas Sandholm
2021	A*	`conf`	Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent. AAAI Gabriele Farina, Christian Kroer, Tuomas Sandholm
2021	A*	`conf`	Finding and Certifying (Near-)Optimal Strategies in Black-Box Extensive-Form Games. AAAI Brian Hu Zhang, Tuomas Sandholm
2021	A*	`conf`	Generalization in Portfolio-Based Algorithm Selection. AAAI Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik
2021	A*	`conf`	How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm design. STOC Maria-Florina Balcan, Dan F. DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, Ellen Vitercik
2021	J	`jnl`	Improved Learning Bounds for Branch-and-Cut. CoRR Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik
2021	A*	`conf`	Learning Within an Instance for Designing High-Revenue Combinatorial Auctions. IJCAI Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm
2021	A*	`conf`	Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games. AAAI Gabriele Farina, Tuomas Sandholm
2021	J	`jnl`	Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games. CoRR Gabriele Farina, Tuomas Sandholm
2021	J	`jnl`	Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games. CoRR Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, Tuomas Sandholm
2021	A*	`conf`	Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond. NeurIPS Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik
2021	J	`jnl`	Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond. CoRR Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik
2021	A*	`conf`	Subgame solving without common knowledge. NeurIPS Brian Hu Zhang, Tuomas Sandholm
2021	J	`jnl`	Subgame solving without common knowledge. CoRR Brian Hu Zhang, Tuomas Sandholm
2021	J	`jnl`	Team Correlated Equilibria in Zero-Sum Extensive-Form Games via Tree Decompositions. CoRR Brian Hu Zhang, Tuomas Sandholm
2020	A*	`conf`	Coarse Correlation in Extensive-Form Games. AAAI Gabriele Farina, Tommaso Bianchi, Tuomas Sandholm
2020	A*	`conf`	Efficient Algorithms for Learning Revenue-Maximizing Two-Part Tariffs. IJCAI Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm
2020	J	`jnl`	Efficient exploration of zero-sum stochastic games. CoRR Carlos Martin, Tuomas Sandholm
2020	J	`jnl`	Faster Algorithms for Optimal Ex-Ante Coordinated Collusive Strategies in Extensive-Form Zero-Sum Games. CoRR Gabriele Farina, Andrea Celli, Nicola Gatti, Tuomas Sandholm
2020	J	`jnl`	Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent. CoRR Gabriele Farina, Christian Kroer, Tuomas Sandholm
2020	J	`jnl`	Faster algorithms for extensive-form game solving via improved smoothing functions. Math. Program. Christian Kroer, Kevin Waugh, Fatma Kilinç-Karzan, Tuomas Sandholm
2020	J	`jnl`	Finding and Certifying (Near-)Optimal Strategies in Black-Box Extensive-Form Games. CoRR Brian Hu Zhang, Tuomas Sandholm
2020	J	`jnl`	Generalization in portfolio-based algorithm selection. CoRR Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik
2020	J	`jnl`	Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries. Oper. Res. Avrim Blum, John P. Dickerson, Nika Haghtalab, Ariel D. Procaccia, Tuomas Sandholm, Ankit Sharma
2020	A*	`conf`	Improving Policy-Constrained Kidney Exchange via Pre-Screening. NeurIPS Duncan C. McElfresh, Michael J. Curry, Tuomas Sandholm, John Dickerson
2020	J	`jnl`	Improving Policy-Constrained Kidney Exchange via Pre-Screening. CoRR Duncan C. McElfresh, Michael J. Curry, Tuomas Sandholm, John P. Dickerson
2020	A*	`conf`	Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees. AAAI Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik
2020	J	`jnl`	Limited lookahead in imperfect-information games. Artif. Intell. Christian Kroer, Tuomas Sandholm
2020	A*	`conf`	Polynomial-Time Computation of Optimal Correlated Equilibria in Two-Player Extensive-Form Games with Public Chance Moves and Beyond. NeurIPS Gabriele Farina, Tuomas Sandholm
2020	J	`jnl`	Polynomial-Time Computation of Optimal Correlated Equilibria in Two-Player Extensive-Form Games with Public Chance Moves and Beyond. CoRR Gabriele Farina, Tuomas Sandholm
2020	A*	`conf`	Refined bounds for algorithm configuration: The knife-edge of dual class approximability. ICML Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik
2020	J	`jnl`	Refined bounds for algorithm configuration: The knife-edge of dual class approximability. CoRR Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik
2020	A*	`conf`	Small Nash Equilibrium Certificates in Very Large Games. NeurIPS Brian Hu Zhang, Tuomas Sandholm
2020	J	`jnl`	Small Nash Equilibrium Certificates in Very Large Games. CoRR Brian Hu Zhang, Tuomas Sandholm
2020	A*	`conf`	Sparsified Linear Programming for Zero-Sum Equilibrium Finding. ICML Brian Hu Zhang, Tuomas Sandholm
2020	J	`jnl`	Sparsified Linear Programming for Zero-Sum Equilibrium Finding. CoRR Brian Hu Zhang, Tuomas Sandholm
2020	A*	`conf`	Stochastic Regret Minimization in Extensive-Form Games. ICML Gabriele Farina, Christian Kroer, Tuomas Sandholm
2020	J	`jnl`	Stochastic Regret Minimization in Extensive-Form Games. CoRR Gabriele Farina, Christian Kroer, Tuomas Sandholm
2020	J	`jnl`	Strong Nash equilibria and mixed strategies. Int. J. Game Theory Eleonora Braggion, Nicola Gatti, Roberto Lucchetti, Tuomas Sandholm, Bernhard von Stengel
2019	J	`jnl`	Coarse Correlation in Extensive-Form Games. CoRR Gabriele Farina, Tommaso Bianchi, Tuomas Sandholm
2019	A*	`conf`	Correlation in Extensive-Form Games: Saddle-Point Formulation and Benchmarks. NeurIPS Gabriele Farina, Chun Kai Ling, Fei Fang, Tuomas Sandholm
2019	J	`jnl`	Correlation in Extensive-Form Games: Saddle-Point Formulation and Benchmarks. CoRR Gabriele Farina, Chun Kai Ling, Fei Fang, Tuomas Sandholm
2019	A*	`conf`	Deep Counterfactual Regret Minimization. ICML Noam Brown, Adam Lerer, Sam Gross, Tuomas Sandholm
2019	J	`jnl`	Efficiency and budget balance in general quasi-linear domains. Games Econ. Behav. Swaprava Nath, Tuomas Sandholm
2019	A*	`conf`	Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium. NeurIPS Gabriele Farina, Chun Kai Ling, Fei Fang, Tuomas Sandholm
2019	J	`jnl`	Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium. CoRR Gabriele Farina, Chun Kai Ling, Fei Fang, Tuomas Sandholm
2019	A*	`conf`	Estimating Approximate Incentive Compatibility. EC Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik
2019	J	`jnl`	Estimating Approximate Incentive Compatibility. CoRR Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik
2019	J	`jnl`	Failure-Aware Kidney Exchange. Manag. Sci. John P. Dickerson, Ariel D. Procaccia, Tuomas Sandholm
2019	J	`jnl`	How much data is sufficient to learn high-performing algorithms? CoRR Maria-Florina Balcan, Dan F. DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, Ellen Vitercik
2019	J	`jnl`	Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees. CoRR Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik
2019	J	`jnl`	Limited Lookahead in Imperfect-Information Games. CoRR Christian Kroer, Tuomas Sandholm
2019	A*	`conf`	Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games. AAAI Gabriele Farina, Christian Kroer, Tuomas Sandholm
2019	A*	`conf`	Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions. NeurIPS Gabriele Farina, Christian Kroer, Tuomas Sandholm
2019	J	`jnl`	Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions. CoRR Gabriele Farina, Christian Kroer, Tuomas Sandholm
2019	A*	`conf`	Quasi-Perfect Stackelberg Equilibrium. AAAI Alberto Marchesi, Gabriele Farina, Christian Kroer, Nicola Gatti, Tuomas Sandholm
2019	A*	`conf`	Regret Circuits: Composability of Regret Minimizers. ICML Gabriele Farina, Christian Kroer, Tuomas Sandholm
2019	A*	`conf`	Solving Imperfect-Information Games via Discounted Regret Minimization. AAAI Noam Brown, Tuomas Sandholm
2019	A*	`conf`	Stable-Predictive Optimistic Counterfactual Regret Minimization. ICML Gabriele Farina, Christian Kroer, Noam Brown, Tuomas Sandholm
2019	J	`jnl`	Stable-Predictive Optimistic Counterfactual Regret Minimization. CoRR Gabriele Farina, Christian Kroer, Noam Brown, Tuomas Sandholm
2018	A*	`conf`	A General Theory of Sample Complexity for Multi-Item Profit Maximization. EC Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik
2018	A*	`conf`	A Unified Framework for Extensive-Form Game Abstraction with Bounds. NeurIPS Christian Kroer, Tuomas Sandholm
2018	J	`jnl`	Composability of Regret Minimizers. CoRR Gabriele Farina, Christian Kroer, Tuomas Sandholm
2018	J	`jnl`	Deep Counterfactual Regret Minimization. CoRR Noam Brown, Adam Lerer, Sam Gross, Tuomas Sandholm
2018	A*	`conf`	Depth-Limited Solving for Imperfect-Information Games. NeurIPS Noam Brown, Tuomas Sandholm, Brandon Amos
2018	J	`jnl`	Depth-Limited Solving for Imperfect-Information Games. CoRR Noam Brown, Tuomas Sandholm, Brandon Amos
2018	A*	`conf`	Ex ante coordination and collusion in zero-sum multi-player extensive-form games. NeurIPS Gabriele Farina, Andrea Celli, Nicola Gatti, Tuomas Sandholm
2018	A*	`conf`	Learning to Branch. ICML Maria-Florina Balcan, Travis Dick, Tuomas Sandholm, Ellen Vitercik
2018	J	`jnl`	Learning to Branch. CoRR Maria-Florina Balcan, Travis Dick, Tuomas Sandholm, Ellen Vitercik
2018	J	`jnl`	Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games. CoRR Gabriele Farina, Christian Kroer, Tuomas Sandholm
2018	A*	`conf`	Practical exact algorithm for trembling-hand equilibrium refinements in games. NeurIPS Gabriele Farina, Nicola Gatti, Tuomas Sandholm
2018	J	`jnl`	Quasi-Perfect Stackelberg Equilibrium. CoRR Alberto Marchesi, Gabriele Farina, Christian Kroer, Nicola Gatti, Tuomas Sandholm
2018	A*	`conf`	Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead. AAAI Christian Kroer, Gabriele Farina, Tuomas Sandholm
2018	—	`conf`	Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead. AAAI Workshops Christian Kroer, Gabriele Farina, Tuomas Sandholm
2018	J	`jnl`	Solving Imperfect-Information Games via Discounted Regret Minimization. CoRR Noam Brown, Tuomas Sandholm
2018	A*	`conf`	Solving Large Sequential Games with the Excessive Gap Technique. NeurIPS Christian Kroer, Gabriele Farina, Tuomas Sandholm
2018	J	`jnl`	Solving Large Sequential Games with the Excessive Gap Technique. CoRR Christian Kroer, Gabriele Farina, Tuomas Sandholm
2018	A*	`conf`	Trembling-Hand Perfection in Extensive-Form Games with Commitment. IJCAI Gabriele Farina, Alberto Marchesi, Christian Kroer, Nicola Gatti, Tuomas Sandholm
2017	A*	`conf`	Dynamic Thresholding and Pruning for Regret Minimization. AAAI Noam Brown, Christian Kroer, Tuomas Sandholm
2017	A*	`conf`	Exclusion Method for Finding Nash Equilibrium in Multiplayer Games. AAAI Kimmo Berg, Tuomas Sandholm
2017	—	`conf`	Inter-Club Kidney Exchange. AAAI Workshops Gabriele Farina, John P. Dickerson, Tuomas Sandholm
2017	A*	`conf`	Libratus: The Superhuman AI for No-Limit Poker. IJCAI Noam Brown, Tuomas Sandholm
2017	J	`jnl`	Multi-Organ Exchange. J. Artif. Intell. Res. John P. Dickerson, Tuomas Sandholm
2017	J	`jnl`	On the Verification and Computation of Strong Nash Equilibrium. CoRR Nicola Gatti, Marco Rocco, Tuomas Sandholm
2017	A*	`conf`	Operation Frames and Clubs in Kidney Exchange. IJCAI Gabriele Farina, John P. Dickerson, Tuomas Sandholm
2017	J	`jnl`	Operation Frames and Clubs in Kidney Exchange. CoRR Gabriele Farina, John P. Dickerson, Tuomas Sandholm
2017	A*	`conf`	Reduced Space and Faster Convergence in Imperfect-Information Games via Pruning. ICML Noam Brown, Tuomas Sandholm
2017	—	`conf`	Reduced Space and Faster Convergence in Imperfect-Information Games via Regret-Based Pruning. AAAI Workshops Noam Brown, Tuomas Sandholm
2017	A*	`conf`	Regret Minimization in Behaviorally-Constrained Zero-Sum Games. ICML Gabriele Farina, Christian Kroer, Tuomas Sandholm
2017	J	`jnl`	Regret Minimization in Behaviorally-Constrained Zero-Sum Games. CoRR Gabriele Farina, Christian Kroer, Tuomas Sandholm
2017	J	`jnl`	Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead. CoRR Christian Kroer, Gabriele Farina, Tuomas Sandholm
2017	—	`conf`	Safe and Nested Endgame Solving for Imperfect-Information Games. AAAI Workshops Noam Brown, Tuomas Sandholm
2017	—	`conf`	Safe and Nested Subgame Solving for Imperfect-Information Games. NIPS Noam Brown, Tuomas Sandholm
2017	J	`jnl`	Safe and Nested Subgame Solving for Imperfect-Information Games. CoRR Noam Brown, Tuomas Sandholm
2017	J	`jnl`	Sample Complexity of Multi-Item Profit Maximization. CoRR Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik
2017	A*	`conf`	Small Representations of Big Kidney Exchange Graphs. AAAI John P. Dickerson, Aleksandr M. Kazachkov, Ariel D. Procaccia, Tuomas Sandholm
2017	—	`conf`	Small Representations of Big Kidney Exchange Graphs. AAAI Workshops John P. Dickerson, Aleksandr M. Kazachkov, Ariel D. Procaccia, Tuomas Sandholm
2017	A*	`conf`	Smoothing Method for Approximate Extensive-Form Perfect Equilibrium. IJCAI Christian Kroer, Gabriele Farina, Tuomas Sandholm
2017	J	`jnl`	Smoothing Method for Approximate Extensive-Form Perfect Equilibrium. CoRR Christian Kroer, Gabriele Farina, Tuomas Sandholm
2017	A*	`conf`	Super-Human AI for Strategic Reasoning: Beating Top Pros in Heads-Up No-Limit Texas Hold'em. IJCAI Tuomas Sandholm
2017	A*	`conf`	Theoretical and Practical Advances on Smoothing for Extensive-Form Games. EC Christian Kroer, Kevin Waugh, Fatma Kilinç-Karzan, Tuomas Sandholm
2017	J	`jnl`	Theoretical and Practical Advances on Smoothing for Extensive-Form Games. CoRR Christian Kroer, Kevin Waugh, Fatma Kilinç-Karzan, Tuomas Sandholm
2016	A*	`conf`	Baby Tartanian8: Winning Agent from the 2016 Annual Computer Poker Competition. IJCAI Noam Brown, Tuomas Sandholm
2016	J	`jnl`	Efficiency and Budget Balance in General Quasi-linear Domains. CoRR Swaprava Nath, Tuomas Sandholm
2016	—	`conf`	Efficiency and Budget Balance. WINE Swaprava Nath, Tuomas Sandholm
2016	A	`conf`	Exclusion Method for Finding Nash Equilibrium in Multi-Player Games: (Extended Abstract). AAMAS Kimmo Berg, Tuomas Sandholm
2016	A*	`conf`	Fast Optimal Clearing of Capped-Chain Barter Exchanges. AAAI Benjamin Plaut, John P. Dickerson, Tuomas Sandholm
2016	J	`jnl`	Hardness of the Pricing Problem for Chains in Barter Exchanges. CoRR Benjamin Plaut, John P. Dickerson, Tuomas Sandholm
2016	A*	`conf`	Imperfect-Recall Abstractions with Bounds in Games. EC Christian Kroer, Tuomas Sandholm
2016	A	`conf`	Multi-Option Descending Clock Auction: (Extended Abstract). AAMAS Tri-Dung Nguyen, Tuomas Sandholm
2016	A*	`conf`	Position-Indexed Formulations for Kidney Exchange. EC John P. Dickerson, David F. Manlove, Benjamin Plaut, Tuomas Sandholm, James Trimble
2016	J	`jnl`	Position-Indexed Formulations for Kidney Exchange. CoRR John P. Dickerson, David F. Manlove, Benjamin Plaut, Tuomas Sandholm, James Trimble
2016	J	`jnl`	Reduced Space and Faster Convergence in Imperfect-Information Games via Regret-Based Pruning. CoRR Noam Brown, Tuomas Sandholm
2016	—	`conf`	Sample Complexity of Automated Mechanism Design. NIPS Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik
2016	J	`jnl`	Sample Complexity of Automated Mechanism Design. CoRR Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik
2016	A*	`conf`	Scalable Segment Abstraction Method for Advertising Campaign Admission and Inventory Allocation Optimization. IJCAI Fei Peng, Tuomas Sandholm
2016	A*	`conf`	Sequential Planning for Steering Immune System Adaptation. IJCAI Christian Kroer, Tuomas Sandholm
2016	J	`jnl`	Small Representations of Big Kidney Exchange Graphs. CoRR John P. Dickerson, Aleksandr M. Kazachkov, Ariel D. Procaccia, Tuomas Sandholm
2016	A*	`conf`	Strategy-Based Warm Starting for Regret Minimization in Games. AAAI Noam Brown, Tuomas Sandholm
2015	A*	`conf`	Abstraction for Solving Large Incomplete-Information Games. AAAI Tuomas Sandholm
2015	J	`jnl`	Automated Design of Revenue-Maximizing Combinatorial Auctions. Oper. Res. Tuomas Sandholm, Anton Likhodedov
2015	A	`conf`	Computational Bundling for Auctions. AAMAS Christian Kroer, Tuomas Sandholm
2015	A	`conf`	Discretization of Continuous Action Spaces in Extensive-Form Games. AAMAS Christian Kroer, Tuomas Sandholm
2015	—	`conf`	Endgame Solving in Large Imperfect-Information Games. AAAI Workshop: Computer Poker and Imperfect Information Sam Ganzfried, Tuomas Sandholm
2015	A	`conf`	Endgame Solving in Large Imperfect-Information Games. AAMAS Sam Ganzfried, Tuomas Sandholm
2015	A*	`conf`	Faster First-Order Methods for Extensive-Form Game Solving. EC Christian Kroer, Kevin Waugh, Fatma Kilinç-Karzan, Tuomas Sandholm
2015	A*	`conf`	FutureMatch: Combining Human Value Judgments and Machine Learning to Match in Dynamic Environments. AAAI John P. Dickerson, Tuomas Sandholm
2015	—	`conf`	Hierarchical Abstraction, Distributed Equilibrium Computation, and Post-Processing, with Application to a Champion No-Limit Texas Hold'em Agent. AAAI Workshop: Computer Poker and Imperfect Information Noam Brown, Sam Ganzfried, Tuomas Sandholm
2015	A	`conf`	Hierarchical Abstraction, Distributed Equilibrium Computation, and Post-Processing, with Application to a Champion No-Limit Texas Hold'em Agent. AAMAS Noam Brown, Sam Ganzfried, Tuomas Sandholm
2015	A*	`conf`	Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries. EC Avrim Blum, John P. Dickerson, Nika Haghtalab, Ariel D. Procaccia, Tuomas Sandholm, Ankit Sharma
2015	A*	`conf`	Limited Lookahead in Imperfect-Information Games. IJCAI Christian Kroer, Tuomas Sandholm
2015	—	`conf`	Regret-Based Pruning in Extensive-Form Games. NIPS Noam Brown, Tuomas Sandholm
2015	J	`jnl`	Safe Opponent Exploitation. ACM Trans. Economics and Comput. Sam Ganzfried, Tuomas Sandholm
2015	A*	`conf`	Simultaneous Abstraction and Equilibrium Finding in Games. IJCAI Noam Brown, Tuomas Sandholm
2015	A*	`conf`	Steering Evolution Strategically: Computational Game Theory and Opponent Exploitation for Treatment Planning, Drug Design, and Synthetic Biology. AAAI Tuomas Sandholm
2015	A*	`conf`	Strategy-Proof and Efficient Kidney Exchange Using a Credit Mechanism. AAAI Chen Hajaj, John P. Dickerson, Avinatan Hassidim, Tuomas Sandholm, David Sarne
2015	A*	`conf`	Tartanian7: A Champion Two-Player No-Limit Texas Hold'em Poker-Playing Program. AAAI Noam Brown, Sam Ganzfried, Tuomas Sandholm
2014	J	`jnl`	Algorithms for Closed Under Rational Behavior (CURB) Sets. CoRR Michael Benisch, George B. Davis, Tuomas Sandholm
2014	—	`conf`	Balancing Efficiency and Fairness in Dynamic Kidney Exchange. AAAI Workshop: Modern Artificial Intelligence for Health Analytics John Paul Dickerson, Tuomas Sandholm
2014	J	`jnl`	Complexity of Mechanism Design. CoRR Vincent Conitzer, Tuomas Sandholm
2014	—	`conf`	Diverse Randomized Agents Vote to Win. NIPS Albert Xin Jiang, Leandro Soriano Marcolino, Ariel D. Procaccia, Tuomas Sandholm, Nisarg Shah, Milind Tambe
2014	J	`jnl`	Extensive-Form Game Imperfect-Recall Abstractions With Bounds. CoRR Christian Kroer, Tuomas Sandholm
2014	A*	`conf`	Extensive-form game abstraction with bounds. EC Christian Kroer, Tuomas Sandholm
2014	A	`conf`	Finding the pareto curve in bimatrix games is easy. AAMAS Nicola Gatti, Tuomas Sandholm
2014	A*	`conf`	Multi-Organ Exchange: The Whole Is Greater than the Sum of its Parts. AAAI John P. Dickerson, Tuomas Sandholm
2014	A*	`conf`	Optimizing prices in descending clock auctions. EC Tri-Dung Nguyen, Tuomas Sandholm
2014	A*	`conf`	Potential-Aware Imperfect-Recall Abstraction with Earth Mover's Distance in Imperfect-Information Games. AAAI Sam Ganzfried, Tuomas Sandholm
2014	—	`conf`	Power napping with loud neighbors: optimal energy-constrained jamming and anti-jamming. WISEC Bruce DeBruhl, Christian Kroer, Anupam Datta, Tuomas Sandholm, Patrick Tague
2014	A	`conf`	Price of fairness in kidney exchange. AAMAS John P. Dickerson, Ariel D. Procaccia, Tuomas Sandholm
2014	A*	`conf`	Regret Transfer and Parameter Optimization. AAAI Noam Brown, Tuomas Sandholm
2014	A*	`conf`	The Computational Rise and Fall of Fairness. AAAI John P. Dickerson, Jonathan R. Goldman, Jeremy Karp, Ariel D. Procaccia, Tuomas Sandholm
2013	J	`jnl`	A Practical Liquidity-Sensitive Automated Market Maker. ACM Trans. Economics and Comput. Abraham Othman, David M. Pennock, Daniel M. Reeves, Tuomas Sandholm
2013	A*	`conf`	Action Translation in Extensive-Form Games with Large Action Spaces: Axioms, Paradoxes, and the Pseudo-Harmonic Mapping. IJCAI Sam Ganzfried, Tuomas Sandholm
2013	A*	`conf`	Algorithms for Strong Nash Equilibrium with More than Two Agents. AAAI Nicola Gatti, Marco Rocco, Tuomas Sandholm
2013	A*	`conf`	Analysis and Optimization of Multi-Dimensional Percentile Mechanisms. IJCAI Xin Sui, Craig Boutilier, Tuomas Sandholm
2013	A*	`conf`	Failure-aware kidney exchange. EC John P. Dickerson, Ariel D. Procaccia, Tuomas Sandholm
2013	J	`jnl`	On the complexity of strong Nash equilibrium: Hard-to-solve instances and smoothed complexity CoRR Nicola Gatti, Marco Rocco, Tuomas Sandholm
2013	A	`conf`	On the verification and computation of strong nash equilibrium. AAMAS Nicola Gatti, Marco Rocco, Tuomas Sandholm
2013	—	`conf`	Strong Nash Equilibrium Is in Smoothed P. AAAI (Late-Breaking Developments) Nicola Gatti, Marco Rocco, Tuomas Sandholm
2013	B	`conf`	Throwing Darts: Random Sampling Helps Tree Search when the Number of Short Certificates Is Moderate. SOCS John Paul Dickerson, Tuomas Sandholm
2013	—	`conf`	Throwing Darts: Random Sampling Helps Tree Search when the Number of Short Certificates is Moderate. AAAI (Late-Breaking Developments) John Paul Dickerson, Tuomas Sandholm
2012	J	`jnl`	Combining local search techniques and path following for bimatrix games CoRR Nicola Gatti, Giorgio Patrini, Marco Rocco, Tuomas Sandholm
2012	A	`conf`	Combining local search techniques and path following for bimatrix games. UAI Nicola Gatti, Giorgio Patrini, Marco Rocco, Tuomas Sandholm
2012	J	`jnl`	Common Voting Rules as Maximum Likelihood Estimators CoRR Vincent Conitzer, Tuomas Sandholm
2012	J	`jnl`	Computing optimal outcomes under an expressive representation of settings with externalities. J. Comput. Syst. Sci. Vincent Conitzer, Tuomas Sandholm
2012	A*	`conf`	Dynamic Matching via Weighted Myopia with Application to Kidney Exchange. AAAI John P. Dickerson, Ariel D. Procaccia, Tuomas Sandholm
2012	J	`jnl`	First-order algorithm with 𝒪(ln(1/ε)) convergence for ε-equilibrium in two-person zero-sum games. Math. Program. Andrew Gilpin, Javier Peña, Tuomas Sandholm
2012	A*	`conf`	Lossy stochastic game abstraction with bounds. EC Tuomas Sandholm, Satinder Singh
2012	A	`conf`	Mixed-bundling auctions with reserve prices. AAMAS Pingzhong Tang, Tuomas Sandholm
2012	A*	`conf`	Optimal Auctions for Spiteful Bidders. AAAI Pingzhong Tang, Tuomas Sandholm
2012	A	`conf`	Optimizing kidney exchange with transplant chains: theory and reality. AAMAS John P. Dickerson, Ariel D. Procaccia, Tuomas Sandholm
2012	A*	`conf`	Profit-charging market makers with bounded loss, vanishing bid/ask spreads, and unlimited market depth. EC Abraham Othman, Tuomas Sandholm
2012	A	`conf`	Rational market making with probabilistic knowledge. AAMAS Abraham Othman, Tuomas Sandholm
2012	A*	`conf`	Safe opponent exploitation. EC Samuel Ganzfried, Tuomas Sandholm
2012	A	`conf`	Strategy purification and thresholding: effective non-equilibrium approaches for playing large games. AAMAS Sam Ganzfried, Tuomas Sandholm, Kevin Waugh
2012	J	`jnl`	TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems Using Game Theory. AI Mag. Zhengyu Yin, Albert Xin Jiang, Milind Tambe, Christopher Kiekintveld, Kevin Leyton-Brown, Tuomas Sandholm, John P. Sullivan
2012	C	`conf`	TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems. IAAI Zhengyu Yin, Albert Xin Jiang, Matthew Paul Johnson, Christopher Kiekintveld, Kevin Leyton-Brown, Tuomas Sandholm, Milind Tambe, John P. Sullivan
2012	—	`conf`	Towards Optimal Patrol Strategies for Fare Inspection in Transit Systems. AAAI Spring Symposium: Game Theory for Security, Sustainability, and Health Albert Xin Jiang, Zhengyu Yin, Matthew P. Johnson, Milind Tambe, Christopher Kiekintveld, Kevin Leyton-Brown, Tuomas Sandholm
2011	—	`conf`	A Framework for Automated Bundling and Pricing Using Purchase Data. AMMA Michael Benisch, Tuomas Sandholm
2011	A*	`conf`	Approximating Optimal Combinatorial Auctions for Complements Using Restricted Welfare Maximization. IJCAI Pingzhong Tang, Tuomas Sandholm
2011	—	`conf`	Automated Market Makers That Enable New Settings: Extending Constant-Utility Cost Functions. AMMA Abraham Othman, Tuomas Sandholm
2011	J	`jnl`	Expressive markets for donating to charities. Artif. Intell. Vincent Conitzer, Tuomas Sandholm
2011	A	`conf`	Game theory-based opponent modeling in large imperfect-information games. AAMAS Sam Ganzfried, Tuomas Sandholm
2011	J	`jnl`	Information-theoretic approaches to branching in search. Discret. Optim. Andrew Gilpin, Tuomas Sandholm
2011	J	`jnl`	Inventory-based versus Prior-based Options Trading Agents. Algorithmic Finance Abraham Othman, Tuomas Sandholm
2011	—	`conf`	Liquidity-Sensitive Automated Market Makers via Homogeneous Risk Measures. WINE Abraham Othman, Tuomas Sandholm
2011	—	`conf`	Strategy Purification. Applied Adversarial Reasoning and Risk Modeling Sam Ganzfried, Tuomas Sandholm, Kevin Waugh
2011	A	`conf`	Strategy purification. AAMAS Sam Ganzfried, Tuomas Sandholm, Kevin Waugh
2010	A*	`conf`	A practical liquidity-sensitive automated market maker. EC Abraham Othman, Tuomas Sandholm, David M. Pennock, Daniel M. Reeves
2010	J	`jnl`	Algorithms for Closed Under Rational Behavior (CURB) Sets. J. Artif. Intell. Res. Michael Benisch, George B. Davis, Tuomas Sandholm
2010	A*	`conf`	Asymmetric Spite in Auctions. AAAI Ankit Sharma, Tuomas Sandholm
2010	A*	`conf`	Automated Channel Abstraction for Advertising Auctions. AAAI William E. Walsh, Craig Boutilier, Tuomas Sandholm, Rob Shields, George L. Nemhauser, David C. Parkes
2010	A*	`conf`	Automated market-making in the large: the gates hillman prediction market. EC Abraham Othman, Tuomas Sandholm
2010	A	`conf`	Combinatorial auctions with externalities. AAMAS Piotr Krysta, Tomasz P. Michalak, Tuomas Sandholm, Michael J. Wooldridge
2010	A	`conf`	Computing equilibria by incorporating qualitative models? AAMAS Sam Ganzfried, Tuomas Sandholm
2010	A	`conf`	Decision rules and decision markets. AAMAS Abraham Othman, Tuomas Sandholm
2010	A*	`conf`	Envy Quotes and the Iterated Core-Selecting Combinatorial Auction. AAAI Abraham Othman, Tuomas Sandholm
2010	A	`conf`	Finding approximate competitive equilibria: efficient and fair course allocation. AAMAS Abraham Othman, Tuomas Sandholm, Eric Budish
2010	J	`jnl`	Smoothing Techniques for Computing Nash Equilibria of Sequential Games. Math. Oper. Res. Samid Hoda, Andrew Gilpin, Javier Peña, Tuomas Sandholm
2010	A	`conf`	Speeding up gradient-based algorithms for sequential games. AAMAS Andrew Gilpin, Tuomas Sandholm
2010	J	`jnl`	The State of Solving Large Incomplete-Information Games, and Application to Poker. AI Mag. Tuomas Sandholm
2010	A	`conf`	When do markets with simple agents fail? AAMAS Abraham Othman, Tuomas Sandholm
2009	B	`conf`	Better with Byzantine: Manipulation-Optimal Mechanisms. SAGT Abraham Othman, Tuomas Sandholm
2009	A*	`conf`	Computing Equilibria in Multiplayer Stochastic Games of Imperfect Information. IJCAI Sam Ganzfried, Tuomas Sandholm
2009	A*	`conf`	How Pervasive Is the Myerson-Satterthwaite Impossibility? IJCAI Abraham Othman, Tuomas Sandholm
2009	A*	`conf`	Methodology for Designing Reasonably Expressive Mechanisms with Application to Ad Auctions. IJCAI Michael Benisch, Norman M. Sadeh, Tuomas Sandholm
2009	A*	`conf`	Online Stochastic Optimization in the Large: Application to Kidney Exchange. IJCAI Pranjal Awasthi, Tuomas Sandholm
2009	A	`conf`	The impact of expressiveness on the effectiveness of privacy mechanisms for location-sharing. SOUPS Michael Benisch, Patrick Gage Kelley, Norman M. Sadeh, Tuomas Sandholm, Janice Y. Tsai, Lorrie Faith Cranor, Paul Hankes Drielsma
2008	A*	`conf`	A Theory of Expressiveness in Mechanisms. AAAI Michael Benisch, Norman M. Sadeh, Tuomas Sandholm
2008	—	`conf`	A heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding programs. AAMAS (2) Andrew Gilpin, Tuomas Sandholm, Troels Bjerre Sørensen
2008	A*	`conf`	Computing Reserve Prices and Identifying the Value Distribution in Real-world Auctions with Market Disruptions. AAAI William E. Walsh, David C. Parkes, Tuomas Sandholm, Craig Boutilier
2008	—	`conf`	Computing an approximate jam/fold equilibrium for 3-player no-limit Texas Hold'em tournaments. AAMAS (2) Sam Ganzfried, Tuomas Sandholm
2008	A*	`conf`	Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker. AAAI Andrew Gilpin, Tuomas Sandholm
2008	A*	`conf`	Expressive Banner Ad Auctions and Model-Based Online Optimization for Clearing. AAAI Craig Boutilier, David C. Parkes, Tuomas Sandholm, William E. Walsh
2008	A*	`conf`	First-Order Algorithm with O(ln(1/e)) Convergence for e-Equilibrium in Two-Person Zero-Sum Games. AAAI Andrew Gilpin, Javier Peña, Tuomas Sandholm
2008	—	`conf`	GS3 and Tartanian: game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs. AAMAS (Demos) Andrew Gilpin, Tuomas Sandholm, Troels Bjerre Sørensen
2008	J	`jnl`	New complexity results about Nash equilibria. Games Econ. Behav. Vincent Conitzer, Tuomas Sandholm
2008	J	`jnl`	On the Existence of Unconditionally Privacy-Preserving Auction Protocols. ACM Trans. Inf. Syst. Secur. Felix Brandt, Tuomas Sandholm
2008	A*	`ed.`	Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), Chicago, IL, USA, June 8-12, 2008 EC Lance Fortnow, John Riedl, Tuomas Sandholm
2008	—	`conf`	Solving two-person zero-sum repeated games of incomplete information. AAMAS (2) Andrew Gilpin, Tuomas Sandholm
2007	—	`conf`	07431 Abstracts Collection - Computational Issues in Social Choice. Computational Issues in Social Choice Ulle Endriss, Jérôme Lang, Francesca Rossi, Tuomas Sandholm
2007	—	`conf`	07431 Executive Summary - Computational Issues in Social Choice. Computational Issues in Social Choice Ulle Endriss, Jérôme Lang, Francesca Rossi, Tuomas Sandholm
2007	J	`jnl`	AWESOME: A general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents. Mach. Learn. Vincent Conitzer, Tuomas Sandholm
2007	A*	`conf`	Automated Design of Multistage Mechanisms. IJCAI Tuomas Sandholm, Vincent Conitzer, Craig Boutilier
2007	A*	`conf`	Automated Online Mechanism Design and Prophet Inequalities. AAAI Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tuomas Sandholm
2007	A	`conf`	Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker. AAMAS Andrew Gilpin, Tuomas Sandholm
2007	A*	`conf`	Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges. EC David J. Abraham, Avrim Blum, Tuomas Sandholm
2007	—	`ed.`	Computational Issues in Social Choice, 21.10. - 26.10.2007 Computational Issues in Social Choice Ulle Endriss, Jérôme Lang, Francesca Rossi, Tuomas Sandholm
2007	C	`conf`	Expressive Commerce and Its Application to Sourcing: How We Conducted $25 Billion of Generalized Combinatorial Auctions. AAIM Tuomas Sandholm
2007	J	`jnl`	Expressive Commerce and Its Application to Sourcing: How We Conducted $35 Billion of Generalized Combinatorial Auctions. AI Mag. Tuomas Sandholm
2007	C	`conf`	Expressive commerce and its application to sourcing: how we conducted $35 billion of generalized combinatorial auctions. ICEC Tuomas Sandholm
2007	—	`conf`	Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games. WINE Andrew Gilpin, Samid Hoda, Javier Peña, Tuomas Sandholm
2007	A*	`conf`	Incremental Mechanism Design. IJCAI Vincent Conitzer, Tuomas Sandholm
2007	A*	`conf`	Information-Theoretic Approaches to Branching in Search. IJCAI Andrew Gilpin, Tuomas Sandholm
2007	J	`jnl`	Lossless abstraction of imperfect information games. J. ACM Andrew Gilpin, Tuomas Sandholm
2007	J	`jnl`	Perspectives on multiagent learning. Artif. Intell. Tuomas Sandholm
2007	A*	`conf`	Potential-Aware Automated Abstraction of Sequential Games, and Holistic Equilibrium Analysis of Texas Hold'em Poker. AAAI Andrew Gilpin, Tuomas Sandholm, Troels Bjerre Sørensen
2007	A*	`conf`	Spiteful Bidding in Sealed-Bid Auctions. IJCAI Felix Brandt, Tuomas Sandholm, Yoav Shoham
2007	J	`jnl`	When are elections with few candidates hard to manipulate?. J. ACM Vincent Conitzer, Tuomas Sandholm, Jérôme Lang
2006	A*	`conf`	A Compact Representation Scheme for Coalitional Games in Open Anonymous Environments. AAAI Naoki Ohta, Atsushi Iwasaki, Makoto Yokoo, Kohki Maruono, Vincent Conitzer, Tuomas Sandholm
2006	A*	`conf`	A Competitive Texas Hold'em Poker Player via Automated Abstraction and Real-Time Equilibrium Computation. AAAI Andrew Gilpin, Tuomas Sandholm
2006	A	`conf`	A Texas Hold'em poker player based on automated abstraction and real-time equilibrium computation. AAMAS Andrew Gilpin, Tuomas Sandholm
2006	A	`conf`	A technique for reducing normal-form games to compute a Nash equilibrium. AAMAS Vincent Conitzer, Tuomas Sandholm
2006	A*	`conf`	Algorithms for Rationalizability and CURB Sets. AAAI Michael Benisch, George B. Davis, Tuomas Sandholm
2006	J	`jnl`	Changing the Game in Strategic Sourcing at Procter & Gamble: Expressive Competition Enabled by Optimization. Interfaces Tuomas Sandholm, David Levine, Michael Concordia, Paul Martyn, Rick Hughes, Jim Jacobs, Dennis Begg
2006	J	`jnl`	Complexity of constructing solutions in the core based on synergies among coalitions. Artif. Intell. Vincent Conitzer, Tuomas Sandholm
2006	A*	`conf`	Computing the optimal strategy to commit to. EC Vincent Conitzer, Tuomas Sandholm
2006	A*	`conf`	Expressive Commerce and Its Application to Sourcing. AAAI Tuomas Sandholm
2006	A	`conf`	Failures of the VCG mechanism in combinatorial auctions and exchanges. AAMAS Vincent Conitzer, Tuomas Sandholm
2006	A*	`conf`	Finding equilibria in large sequential games of imperfect information. EC Andrew Gilpin, Tuomas Sandholm
2006	A	`conf`	Information-theoretic approaches to branching in search. AAMAS Andrew Gilpin, Tuomas Sandholm
2006	A*	`conf`	Nonexistence of Voting Rules That Are Usually Hard to Manipulate. AAAI Vincent Conitzer, Tuomas Sandholm
2006	J	`jnl`	Online algorithms for market clearing. J. ACM Avrim Blum, Tuomas Sandholm, Martin Zinkevich
2006	A	`conf`	Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation. AAMAS Tuomas Sandholm, Andrew Gilpin
2006	J	`jnl`	Side constraints and non-price attributes in markets. Games Econ. Behav. Tuomas Sandholm, Subhash Suri
2005	—	`conf`	05011 Abstracts Collection - Computing and Markets. Computing and Markets Daniel Lehmann, Rudolf Müller, Tuomas Sandholm
2005	—	`conf`	05011 Executive Summary - Computing and Markets. Computing and Markets Daniel Lehmann, Rudolf Müller, Tuomas Sandholm
2005	A*	`conf`	A Generalized Strategy Eliminability Criterion and Computational Methods for Applying It. AAAI Vincent Conitzer, Tuomas Sandholm
2005	—	`conf`	A New Solution Concept for Coalitional Games in Open Anonymous Environments. JSAI Workshops Makoto Yokoo, Vincent Conitzer, Tuomas Sandholm, Naoki Ohta, Atsushi Iwasaki
2005	A*	`conf`	Approximating Revenue-Maximizing Combinatorial Auctions. AAAI Anton Likhodedov, Tuomas Sandholm
2005	—	`conf`	Automated Mechanism Design. Computing and Markets Tuomas Sandholm
2005	J	`jnl`	CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions. Manag. Sci. Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine
2005	A*	`conf`	Coalitional Games in Open Anonymous Environments. AAAI Makoto Yokoo, Vincent Conitzer, Tuomas Sandholm, Naoki Ohta, Atsushi Iwasaki
2005	A*	`conf`	Coalitional Games in Open Anonymous Environments. IJCAI Makoto Yokoo, Vincent Conitzer, Tuomas Sandholm, Naoki Ohta, Atsushi Iwasaki
2005	A*	`conf`	Combinatorial Auctions with AAAI Vincent Conitzer, Tuomas Sandholm, Paolo Santi
2005	A	`conf`	Common Voting Rules as Maximum Likelihood Estimators. UAI Vincent Conitzer, Tuomas Sandholm
2005	A*	`conf`	Communication complexity of common voting rules. EC Vincent Conitzer, Tuomas Sandholm
2005	A*	`conf`	Complexity of (iterated) dominance. EC Vincent Conitzer, Tuomas Sandholm
2005	—	`ed.`	Computing and Markets, 3.-7. January 2005 Computing and Markets Daniel Lehmann, Rudolf Müller, Tuomas Sandholm
2005	A	`conf`	Decentralized voting with unconditional privacy. AAMAS Felix Brandt, Tuomas Sandholm
2005	—	`conf`	Efficient Privacy-Preserving Protocols for Multi-unit Auctions. Financial Cryptography Felix Brandt, Tuomas Sandholm
2005	A*	`conf`	Expressive Negotiation in Settings with Externalities. AAAI Vincent Conitzer, Tuomas Sandholm
2005	A	`conf`	Mechanism design and deliberative agents. AAMAS Kate Larson, Tuomas Sandholm
2005	A*	`conf`	Mixed-Integer Programming Methods for Finding Nash Equilibria. AAAI Tuomas Sandholm, Andrew Gilpin, Vincent Conitzer
2005	—	`conf`	On Correctness and Privacy in Distributed Mechanisms. AMEC@AAMAS/TADA@IJCAI Felix Brandt, Tuomas Sandholm
2005	A*	`conf`	Optimal Rhode Island Hold'em Poker. AAAI Andrew Gilpin, Tuomas Sandholm
2005	—	`conf`	Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation. Computing and Markets Tuomas Sandholm, Andrew Gilpin
2005	—	`conf`	Spiteful Bidding in Sealed-Bid Auctions. Computing and Markets Felix Brandt, Tuomas Sandholm, Yoav Shoham
2005	B	`conf`	Unconditional privacy in social choice. TARK Felix Brandt, Tuomas Sandholm
2004	A	`conf`	An Algorithm for Automatically Designing Deterministic Mechanisms without Payments. AAMAS Vincent Conitzer, Tuomas Sandholm
2004	A	`conf`	Anonymous Pricing of Efficient Allocations in Combinatorial Economies. AAMAS Wolfram Conen, Tuomas Sandholm
2004	A*	`conf`	Combinatorial Auctions with Structured Item Graphs. AAAI Vincent Conitzer, Jonathan Derryberry, Tuomas Sandholm
2004	A*	`conf`	Communication complexity as a lower bound for learning in games. ICML Vincent Conitzer, Tuomas Sandholm
2004	A*	`conf`	Computational criticisms of the revelation principle. EC Vincent Conitzer, Tuomas Sandholm
2004	A*	`conf`	Computing Shapley Values, Manipulating Value Division Schemes, and Checking Core Membership in Multi-Issue Domains. AAAI Vincent Conitzer, Tuomas Sandholm
2004	—	`conf`	Designing Auctions for Deliberative Agents. AMEC Kate Larson, Tuomas Sandholm
2004	A	`conf`	Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions. AAMAS Benoît Hudson, Tuomas Sandholm
2004	A*	`conf`	Eliciting Bid Taker Non-price Preferences in (Combinatorial) Auctions. AAAI Craig Boutilier, Tuomas Sandholm, Rob Shields
2004	A	`conf`	Experiments on Deliberation Equilibria in Auctions. AAMAS Kate Larson, Tuomas Sandholm
2004	A*	`conf`	Expressive negotiation over donations to charities. EC Vincent Conitzer, Tuomas Sandholm
2004	A	`conf`	Im)Possibility of Unconditionally Privacy-Preserving Auctions. AAMAS Felix Brandt, Tuomas Sandholm
2004	A*	`conf`	Mechanism for optimally trading off revenue and efficiency in multi-unit auctions. EC Anton Likhodedov, Tuomas Sandholm
2004	A*	`conf`	Methods for Boosting Revenue in Combinatorial Auctions. AAAI Anton Likhodedov, Tuomas Sandholm
2004	J	`jnl`	Preference Elicitation and Query Learning. J. Mach. Learn. Res. Avrim Blum, Jeffrey C. Jackson, Tuomas Sandholm, Martin Zinkevich
2004	—	`conf`	Revenue Failures and Collusion in Combinatorial Auctions and Exchanges with VCG Payments. AMEC Vincent Conitzer, Tuomas Sandholm
2004	A*	`conf`	Revenue failures and collusion in combinatorial auctions and exchanges with vcg payments. EC Vincent Conitzer, Tuomas Sandholm
2004	A*	`conf`	Self-interested automated mechanism design and implications for optimal combinatorial auctions. EC Vincent Conitzer, Tuomas Sandholm
2004	A	`conf`	Solving Combinatorial Exchanges: Optimality via a Few Partial Bids. AAMAS Anshul Kothari, Tuomas Sandholm, Subhash Suri
2004	A*	`conf`	Strategic deliberation and truthful revelation: an impossibility result. EC Kate Larson, Tuomas Sandholm
2004	A*	`conf`	Towards a Characterization of Polynomial Preference Elicitation with Value Queries in Combinatorial Auctions (Extended Abstract). COLT Paolo Santi, Vincent Conitzer, Tuomas Sandholm
2004	A*	`conf`	Using Performance Profile Trees to Improve Deliberation Control. AAAI Kate Larson, Tuomas Sandholm
2003	J	`jnl`	AWESOME: A General Multiagent Learning Algorithm that Converges in Self-Play and Learns a Best Response Against Stationary Opponents CoRR Vincent Conitzer, Tuomas Sandholm
2003	A*	`conf`	AWESOME: A General Multiagent Learning Algorithm that Converges in Self-Play and Learns a Best Response Against Stationary Opponents. ICML Vincent Conitzer, Tuomas Sandholm
2003	A*	`conf`	Auction mechanism for optimally trading off revenue and efficiency. EC Anton Likhodedov, Tuomas Sandholm
2003	B	`conf`	Auctions with Untrustworthy Bidders. CEC Sviatoslav B. Braynov, Tuomas Sandholm
2003	A	`conf`	Automated Mechanism Design: A New Application Area for Search Algorithms. CP Tuomas Sandholm
2003	A*	`conf`	Automated mechanism design for a self-interested designer. EC Vincent Conitzer, Tuomas Sandholm
2003	C	`conf`	Automated mechanism design: complexity results stemming from the single-agent setting. ICEC Vincent Conitzer, Tuomas Sandholm
2003	J	`jnl`	BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games CoRR Vincent Conitzer, Tuomas Sandholm
2003	A*	`conf`	BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games. ICML Vincent Conitzer, Tuomas Sandholm
2003	J	`jnl`	BOB: Improved winner determination in combinatorial auctions and generalizations. Artif. Intell. Tuomas Sandholm, Subhash Suri
2003	A*	`conf`	Complexity Results about Nash Equilibria. IJCAI Vincent Conitzer, Tuomas Sandholm
2003	J	`jnl`	Complexity of Determining Nonemptiness of the Core CoRR Vincent Conitzer, Tuomas Sandholm
2003	A*	`conf`	Complexity of Determining Nonemptiness of the Core. IJCAI Vincent Conitzer, Tuomas Sandholm
2003	A*	`conf`	Complexity of determining nonemptiness of the core. EC Vincent Conitzer, Tuomas Sandholm
2003	J	`jnl`	Compressing Two-Dimensional Routing Tables. Algorithmica Subhash Suri, Tuomas Sandholm, Priyank Ramesh Warkhede
2003	J	`jnl`	Definition and Complexity of Some Basic Metareasoning Problems CoRR Vincent Conitzer, Tuomas Sandholm
2003	A*	`conf`	Definition and Complexity of Some Basic Metareasoning Problems. IJCAI Vincent Conitzer, Tuomas Sandholm
2003	A*	`conf`	Differential-revelation VCG mechanisms for combinatorial auctions. EC Wolfram Conen, Tuomas Sandholm
2003	A	`conf`	Generalizing preference elicitation in combinatorial auctions. AAMAS Benoît Hudson, Tuomas Sandholm
2003	B	`conf`	How many candidates are needed to make elections hard to manipulate? TARK Vincent Conitzer, Jérôme Lang, Tuomas Sandholm
2003	J	`jnl`	How many candidates are needed to make elections hard to manipulate? CoRR Vincent Conitzer, Jérôme Lang, Tuomas Sandholm
2003	—	`conf`	Learning Near-Pareto-Optimal Conventions in Polynomial Time. NIPS Xiao Feng Wang, Tuomas Sandholm
2003	A*	`conf`	Making Markets and Democracy Work: A Story of Incentives and Computing. IJCAI Tuomas Sandholm
2003	—	`conf`	Mechanism for Optimally Trading Off Revenue and Efficiency in Multi-unit Auctions. AMEC Anton Likhodedov, Tuomas Sandholm
2003	A	`conf`	Miscomputing ratio: social cost of selfish computing. AAMAS Kate Larson, Tuomas Sandholm
2003	A*	`conf`	On polynomial-time preference elicitation with value queries. EC Martin Zinkevich, Avrim Blum, Tuomas Sandholm
2003	A*	`conf`	Preference Elicitation and Query Learning. COLT Avrim Blum, Jeffrey C. Jackson, Tuomas Sandholm, Martin Zinkevich
2003	—	`conf`	Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation. AMEC Tuomas Sandholm, Andrew Gilpin
2003	A*	`conf`	Solving combinatorial exchanges: optimality via a few partial bids. EC Anshul Kothari, Tuomas Sandholm, Subhash Suri
2003	A	`conf`	Terminating Decision Algorithms Optimally. CP Tuomas Sandholm
2003	J	`jnl`	Universal Voting Protocol Tweaks to Make Manipulation Hard CoRR Vincent Conitzer, Tuomas Sandholm
2003	A*	`conf`	Universal Voting Protocol Tweaks to Make Manipulation Hard. IJCAI Vincent Conitzer, Tuomas Sandholm
2003	A*	`conf`	Using value queries in combinatorial auctions. EC Benoît Hudson, Tuomas Sandholm
2002	—	`conf`	(Im)possibility of Safe Exchange Mechanism Design. AAAI/IAAI Tuomas Sandholm, Xiao Feng Wang
2002	J	`jnl`	Algorithm for optimal winner determination in combinatorial auctions. Artif. Intell. Tuomas Sandholm
2002	A	`conf`	An alternating offers bargaining model for computationally limited agents. AAMAS Kate Larson, Tuomas Sandholm
2002	A	`conf`	Bidders with hard valuation problems. AAMAS Kate Larson, Tuomas Sandholm
2002	J	`jnl`	Complexity Results about Nash Equilibria CoRR Vincent Conitzer, Tuomas Sandholm
2002	J	`jnl`	Complexity of Manipulating Elections with Few Candidates CoRR Vincent Conitzer, Tuomas Sandholm
2002	—	`conf`	Complexity of Manipulating Elections with Few Candidates. AAAI/IAAI Vincent Conitzer, Tuomas Sandholm
2002	J	`jnl`	Complexity of Mechanism Design CoRR Vincent Conitzer, Tuomas Sandholm
2002	A	`conf`	Complexity of Mechanism Design. UAI Vincent Conitzer, Tuomas Sandholm
2002	J	`jnl`	Contracting With Uncertain Level Of Trust. Comput. Intell. Sviatoslav B. Braynov, Tuomas Sandholm
2002	—	`conf`	Differential -Revelation VCG Mechanisms for Combinatorial Auctions. AMEC Wolfram Conen, Tuomas Sandholm
2002	J	`jnl`	Effectiveness of Preference Elicitation in Combinatorial Auctions CoRR Benoît Hudson, Tuomas Sandholm
2002	—	`conf`	Effectiveness of Preference Elicitation in Combinatorial Auctions. AMEC Benoît Hudson, Tuomas Sandholm
2002	A	`conf`	Incentive compatible mechanism for trust revelation. AAMAS Sviatoslav B. Braynov, Tuomas Sandholm
2002	J	`jnl`	Leveled-Commitment Contracting: A Backtracking Instrument for Multiagent Systems. AI Mag. Tuomas Sandholm, Victor R. Lesser
2002	B	`conf`	Market Clearing with Supply and Demand Curves. ISAAC Tuomas Sandholm, Subhash Suri
2002	A*	`conf`	Online algorithms for market clearing. SODA Avrim Blum, Tuomas Sandholm, Martin Zinkevich
2002	—	`conf`	Partial-Revelation VCG Mechanism for Combinatorial Auctions. AAAI/IAAI Wolfram Conen, Tuomas Sandholm
2002	A	`conf`	Preference elicitation in combinatorial auctions. AAMAS Wolfram Conen, Tuomas Sandholm
2002	—	`conf`	Reinforcement Learning to Play an Optimal Nash Equilibrium in Team Markov Games. NIPS Xiaofeng Wang, Tuomas Sandholm
2002	J	`jnl`	Surplus equivalence of leveled commitment contracts. Artif. Intell. Tuomas Sandholm, Yunhong Zhou
2002	J	`jnl`	Vote Elicitation: Complexity and Strategy-Proofness CoRR Vincent Conitzer, Tuomas Sandholm
2002	—	`conf`	Vote Elicitation: Complexity and Strategy-Proofness. AAAI/IAAI Vincent Conitzer, Tuomas Sandholm
2002	A	`conf`	Winner determination in combinatorial auction generalizations. AAMAS Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine
2002	J	`jnl`	eMediator: A Next Generation Electronic Commerce Server. Comput. Intell. Tuomas Sandholm
2001	J	`jnl`	Bargaining with limited computation: Deliberation equilibrium. Artif. Intell. Kate Larson, Tuomas Sandholm
2001	A*	`conf`	CABOB: A Fast Optimal Algorithm for Combinatorial Auctions. IJCAI Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine
2001	J	`jnl`	Leveled Commitment Contracts and Strategic Breach. Games Econ. Behav. Tuomas Sandholm, Victor R. Lesser
2001	A*	`conf`	Market Clearability. IJCAI Tuomas Sandholm, Subhash Suri
2001	A*	`conf`	Preference elicitation in combinatorial auctions. EC Wolfram Conen, Tuomas Sandholm
2000	J	`jnl`	Agents in Electronic Commerce: Component Technologies for Automated Negation and Coalition Formation. Auton. Agents Multi Agent Syst. Tuomas Sandholm
2000	J	`jnl`	Anytime coalition structure generation: an average case study. J. Exp. Theor. Artif. Intell. Kate Larson, Tuomas Sandholm
2000	J	`jnl`	Approaches to winner determination in combinatorial auctions. Decis. Support Syst. Tuomas Sandholm
2000	J	`jnl`	Automated contracting in distributed manufacturing among independent companies. J. Intell. Manuf. Tuomas Sandholm
2000	A	`conf`	Contract Type Sequencing for Reallocative Negotiation. ICDCS Martin Andersson, Tuomas Sandholm
2000	—	`conf`	Deliberation in Equilibrium: Bargaining in Computationally Complex Problems. AAAI/IAAI Kate Larson, Tuomas Sandholm
2000	—	`conf`	Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations. AAAI/IAAI Tuomas Sandholm, Subhash Suri
2000	J	`jnl`	Issues in Computational Vickrey Auctions. Int. J. Electron. Commer. Tuomas Sandholm
2000	J	`jnl`	Nomad: Mobile Agent System for an Internet-Based Auction House. IEEE Internet Comput. Tuomas Sandholm, Qianbo Huai
2000	—	`conf`	Optimal Flow Aggregation. SWAT Subhash Suri, Tuomas Sandholm, Priyank Ramesh Warkhede
2000	—	`conf`	Reasoning About Others: Representing and Processing Infinite Belief Hierarchies. ICMAS Sviatoslav B. Brainov, Tuomas Sandholm
2000	—	`conf`	Safe Exchange Planner. ICMAS Tuomas Sandholm, Vincent Ferrandon
2000	—	`conf`	Surplus Equivalence of Leveled Commitment Contracts. ICMAS Tuomas Sandholm, Yunhong Zhou
1999	A*	`conf`	Algorithms for Optimizing Leveled Commitment Contracts. IJCAI Tuomas Sandholm, Sandeep Sikka, Samphel Norden
1999	A*	`conf`	An Algorithm for Optimal Winner Determination in Combinatorial Auctions. IJCAI Tuomas Sandholm
1999	—	`conf`	Anytime Coalition Structure Generation: An Average Case Study. Agents Kate Larson, Tuomas Sandholm
1999	J	`jnl`	Automated Negotiation. Commun. ACM Tuomas Sandholm
1999	—	`conf`	Bargaining with Deadlines. AAAI/IAAI Tuomas Sandholm, Nir Vulkan
1999	J	`jnl`	Coalition Formation Processes with Belief Revision among Bounded-rational Self-interested Agents. J. Log. Comput. Fernando Tohmé, Tuomas Sandholm
1999	J	`jnl`	Coalition Structure Generation with Worst Case Guarantees. Artif. Intell. Tuomas Sandholm, Kate Larson, Martin Andersson, Onn Shehory, Fernando Tohmé
1999	A*	`conf`	Contracting with uncertain level of trust. EC Sviatoslav B. Brainov, Tuomas Sandholm
1999	—	`conf`	Power, Dependence and Stability in Multiagent Plans. AAAI/IAAI Sviatoslav B. Brainov, Tuomas Sandholm
1999	—	`conf`	Time-Quality Tradeoffs in Reallocative Negotiation with Combinatorial Contract Types. AAAI/IAAI Martin Andersson, Tuomas Sandholm
1999	—	`conf`	eMediator: a Next Generation Electronic Commerce Server. AAAI/IAAI Tuomas Sandholm
1998	—	`conf`	Agent-Mediated Electronic Commerce: Issues, Challenges and Some Viewpoints. Agents Hyacinth S. Nwana, Jeffrey S. Rosenschein, Tuomas Sandholm, Carles Sierra, Pattie Maes, Robert H. Guttman
1998	—	`conf`	Agents in Electronic Commerce: Component Technologies for Automated Negation and Coalition Formation. CIA Tuomas Sandholm
1998	—	`conf`	Agents in Electronic Commerce: Component Technologies for Automated Negotiation and Coalition Formation. ICMAS Tuomas Sandholm
1998	J	`jnl`	Anytime Coalition Structure Generation with Worst Case Guarantees CoRR Tuomas Sandholm, Kate Larson, Martin Andersson, Onn Shehory, Fernando Tohmé
1998	—	`conf`	Anytime Coalition Structure Generation with Worst Case Guarantees. AAAI/IAAI Tuomas Sandholm, Kate Larson, Martin Andersson, Onn Shehory, Fernando Tohmé
1998	—	`conf`	Leveled Commitment Contracting among Myopic Individually Rational Agents. ICMAS Martin Andersson, Tuomas Sandholm
1998	—	`conf`	Leveled Commitment Contracts with Myopic and Strategic Agents. AAAI/IAAI Martin Andersson, Tuomas Sandholm
1998	—	`conf`	Sequencing of Contract Types for Anytime Task Reallocation. AMET Martin Andersson, Tuomas Sandholm
1997	J	`jnl`	Coalitions Among Computationally Bounded Agents. Artif. Intell. Tuomas Sandholm, Victor R. Lesser
1997	—	`conf`	On the Gains and Losses of Speculation in Equilibrium Markets. IJCAI (1) Tuomas Sandholm, Fredrik Ygge
1997	J	`jnl`	Unenforced E-Commerce Transactions. IEEE Internet Comput. Tuomas Sandholm
1996	—	`conf`	A Second Order Parameter for 3SAT. AAAI/IAAI, Vol. 1 Tuomas Sandholm
1996	—	`conf`	Advantages of a Leveled Commitment Contracting Protocol. AAAI/IAAI, Vol. 1 Tuomas Sandholm, Victor R. Lesser
1995	A*	`conf`	Coalition Formation among Bounded Rational Agents. IJCAI (1) Tuomas Sandholm, Victor R. Lesser
1995	A*	`conf`	Equilibrium Analysis of the Possibilities of Unenforced Exchange in Multiagent Systems. IJCAI (1) Tuomas Sandholm, Victor R. Lesser
1995	—	`conf`	Issues in Automated Negotiation and Electronic Commerce: Extending the Contract Net Framework. ICMAS Tuomas Sandholm, Victor R. Lesser
1995	—	`conf`	On Multiagent Q-Learning in a Semi-Competitive Domain. Adaption and Learning in Multi-Agent Systems Tuomas Sandholm, Robert H. Crites
1994	A*	`conf`	Exploiting Meta-Level information in a Distributed Scheduling System. AAAI Daniel E. Neiman, David W. Hildum, Victor R. Lesser, Tuomas Sandholm
1993	A*	`conf`	An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations. AAAI Tuomas Sandholm