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
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 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 Refined Bounds for Algorithm Configuration: The Knife-edge of Dual Class Approximability 2020 • INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 119 • 119: Balcan M-F, Sandholm T, Vitercik E
Preprint Refined bounds for algorithm configuration: The knife-edge of dual class approximability 2020 Balcan M-F, Sandholm T, Vitercik E
Conference Small Nash Equilibrium Certificates in Very Large Games 2020 • Advances in Neural Information Processing Systems • 33: Zhang BH, Sandholm T
Conference Sparsified linear programming for zero-sum equilibrium finding 2020 • 37th International Conference on Machine Learning Icml 2020 • PartF168147-15:11192-11203 Zhang BH, Sandholm T
Conference Stochastic regret minimization in extensive-form games 2020 • 37th International Conference on Machine Learning Icml 2020 • PartF168147-4:2999-3009 Farina G, Kroer C, Sandholm T
Journal Article Strong Nash equilibria and mixed strategies 2020 • International Journal of Game Theory • 49(3):699-710 Braggion E, Gatti N, Lucchetti R, Sandholm T, von Stengel B
Preprint Correlation in Extensive-Form Games: Saddle-Point Formulation and Benchmarks 2019 Farina G, Ling CK, Fang F, Sandholm T
Conference Correlation in Extensive-Form Games: Saddle-Point Formulation and Benchmarks 2019 • Advances in Neural Information Processing Systems • 32: Farina G, Ling CK, Fang F, Sandholm T
Conference Deep Counterfactual Regret Minimization 2019 • INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97 • 97: Brown N, Lerer A, Gross S, Sandholm T
Journal Article Efficiency and budget balance in general quasi-linear domains 2019 • Games and Economic Behavior • 113:673-693 Nath S, Sandholm T
Preprint Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium 2019 Farina G, Ling CK, Fang F, Sandholm T
Conference Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium 2019 • Advances in Neural Information Processing Systems • 32: Farina G, Ling CK, Fang F, Sandholm T
