Sample complexity of tree search configuration: Cutting planes and beyond MF Balcan, S Prasad, T Sandholm, E Vitercik Advances in Neural Information Processing Systems 34, 4015-4027, 2021 | 26 | 2021 |
Structural analysis of branch-and-cut and the learnability of gomory mixed integer cuts MF Balcan, S Prasad, T Sandholm, E Vitercik Advances in Neural Information Processing Systems 35, 33890-33903, 2022 | 10 | 2022 |
Improved sample complexity bounds for branch-and-cut MF Balcan, S Prasad, T Sandholm, E Vitercik 28th International Conference on Principles and Practice of Constraint …, 2022 | 10 | 2022 |
Efficient algorithms for learning revenue-maximizing two-part tariffs MF Balcan, S Prasad, T Sandholm Proceedings of the Twenty-Ninth International Joint Conference on Artificial …, 2020 | 10 | 2020 |
Walks on primes in imaginary quadratic fields S Prasad arXiv preprint arXiv:1412.2310, 2014 | 5 | 2014 |
Bicriteria Multidimensional Mechanism Design with Side Information MF Balcan, S Prasad, T Sandholm Thirty-seventh Conference on Neural Information Processing Systems, 2023 | 4 | 2023 |
Learning Within an Instance for Designing High-Revenue Combinatorial Auctions MF Balcan, S Prasad, T Sandholm IJCAI, 31-37, 2021 | 4 | 2021 |
Learning Time Dependent Choice Z Chase, S Prasad 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2018 | 4 | 2018 |
Content prompting: Modeling content provider dynamics to improve user welfare in recommender ecosystems S Prasad, M Mladenov, C Boutilier arXiv preprint arXiv:2309.00940, 2023 | 2 | 2023 |
Maximizing Revenue under Market Shrinkage and Market Uncertainty MF Balcan, S Prasad, T Sandholm Advances in Neural Information Processing Systems 35, 1643-1655, 2022 | 2 | 2022 |
Incentive Compatible Active Learning F Echenique, S Prasad 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2019 | 1 | 2019 |
New Sequence-Independent Lifting Techniques for Cutting Planes and When They Induce Facets S Prasad, E Vitercik, MF Balcan, T Sandholm arXiv preprint arXiv:2401.13773, 2024 | | 2024 |