Conference Better Regularization for Sequential Decision Spaces 2021 432-432 Farina G, Kroer C, Sandholm T
Preprint Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria 2021 Farina G, Kroer C, Sandholm T
Conference Connecting Optimal Ex-Ante Collusion in Teams to Extensive-Form Correlation: Faster Algorithms and Positive Complexity Results 2021 • INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139 • 139: Farina G, Celli A, Gatti N, Sandholm T
Preprint Efficient Decentralized Learning Dynamics for Extensive-Form Coarse Correlated Equilibrium: No Expensive Computation of Stationary Distributions Required 2021 Farina G, Celli A, Sandholm T
Conference Equilibrium Refinement for the Age of Machines: The One-Sided Quasi-Perfect Equilibrium 2021 • Advances in Neural Information Processing Systems • 11:8845-8856 Farina G, Sandholm T
Preprint Fast Payoff Matrix Sparsification Techniques for Structured Extensive-Form Games 2021 Farina G, Sandholm T
Conference Finding and Certifying (Near-)Optimal Strategies in Black-Box Extensive-Form Games 2021 • Proceedings of the ... AAAI Conference on Artificial Intelligence. AAAI Conference on Artificial Intelligence • 35:5779-5788 Zhang BH, Sandholm T
Conference Generalization in Portfolio-Based Algorithm Selection 2021 • Proceedings of the ... AAAI Conference on Artificial Intelligence. AAAI Conference on Artificial Intelligence • 35:12225-12232 Balcan M-F, Sandholm T, Vitercik E
Conference How Much Data Is Sufficient to Learn High-Performing Algorithms? Generalization Guarantees for Data-Driven Algorithm Design 2021 • Annual ACM Symposium on Theory of Computing • 919-932 Balcan M-F, DeBlasio D, Dick T, Kingsford C, Sandholm T, Vitercik E
Preprint Improved Sample Complexity Bounds for Branch-and-Cut 2021 Balcan M-F, Prasad S, Sandholm T, Vitercik E
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
