Conference Improving Policy-constrained Kidney Exchange via Pre-screening 2021 • American Journal of Transplantation • 21:463-464 McElfresh DC, Curry M, Booker S, Stuart M, Stewart D, Leishman R, Sandholm T, Dickerson J
Conference Learning Within an Instance for Designing High-Revenue Combinatorial Auctions 2021 • IJCAI International Joint Conference on Artificial Intelligence • 31-37 Balcan M-F, Prasad S, Sandholm T
Preprint Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games 2021 Farina G, Sandholm T
Preprint Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games 2021 Anagnostides I, Daskalakis C, Farina G, Fishelson M, Golowich N, Sandholm T
Preprint Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond 2021 Balcan M-F, Prasad S, Sandholm T, Vitercik E
Conference Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond 2021 • Advances in Neural Information Processing Systems • 34: Balcan M-F, Prasad S, Sandholm T, Vitercik E
Conference Subgame solving without common knowledge 2021 • Advances in Neural Information Processing Systems Zhang BH, Sandholm T
Preprint Team Correlated Equilibria in Zero-Sum Extensive-Form Games via Tree Decompositions 2021 Zhang BH, Sandholm T
Journal Article Using machine learning to improve survival prediction after heart transplantation 2021 • Journal of Cardiac Surgery • 36(11):4113-4120 Ayers B, Sandhold T, Gosev I, Prasad S, Kilic A
Conference Efficient Algorithms for Learning Revenue-Maximizing Two-Part Tariffs 2020 • IJCAI International Joint Conference on Artificial Intelligence • 332-338 Balcan M-F, Prasad S, Sandholm T
Journal Article Faster algorithms for extensive-form game solving via improved smoothing functions 2020 • Mathematical programming • 179(1-2):385-417 Kroer C, Waugh K, Kilinc-Karzan F, Sandholm T
Preprint Faster Algorithms for Optimal Ex-Ante Coordinated Collusive Strategies in Extensive-Form Zero-Sum Games 2020 Farina G, Celli A, Gatti N, Sandholm T
Preprint Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent 2020 Farina G, Kroer C, Sandholm T
Preprint Finding and Certifying (Near-)Optimal Strategies in Black-Box Extensive-Form Games 2020 Zhang BH, Sandholm T
Preprint Generalization in portfolio-based algorithm selection 2020 Balcan M-F, Sandholm T, Vitercik E
Journal Article Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries 2020 • Operations Research • 68(1):16-34 Blum A, Dickerson JP, Haghtalab N, Procaccia AD, Sandholm T, Sharma A
Preprint Improving Policy-Constrained Kidney Exchange via Pre-Screening 2020 McElfresh DC, Curry M, Sandholm T, Dickerson JP
Conference Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees 2020 • Proceedings of the ... AAAI Conference on Artificial Intelligence. AAAI Conference on Artificial Intelligence • 34:3227-3234 Balcan M-F, Sandholm T, Vitercik E
Journal Article Limited lookahead in imperfect-information games 2020 • Artificial Intelligence • 283:103218 Kroer C, Sandholm T
Preprint Polynomial-Time Computation of Optimal Correlated Equilibria in Two-Player Extensive-Form Games with Public Chance Moves and Beyond 2020 Farina G, Sandholm T
Conference Polynomial-time computation of optimal correlated equilibria in two-player extensive-form games with public chance moves and beyond 2020 • Advances in Neural Information Processing Systems • 2020-December: Farina G, Sandholm T
Preprint Refined bounds for algorithm configuration: The knife-edge of dual class approximability 2020 Balcan M-F, Sandholm T, Vitercik E
