Siddharth Prasad

Martin Mladenov

Craig Boutilier

CoRR, 2023

Bicriteria Multidimensional Mechanism Design with Side Information.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022

Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Maximizing Revenue under Market Shrinkage and Market Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Improved Sample Complexity Bounds for Branch-And-Cut.

[BibT_eX]

[DOI]

Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming, 2022

2021

Improved Learning Bounds for Branch-and-Cut.

[BibT_eX]

[DOI]

CoRR, 2021

Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Learning Within an Instance for Designing High-Revenue Combinatorial Auctions.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020

Incentive Compatible Active Learning.

[BibT_eX]

[DOI]

Federico Echenique

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Efficient Algorithms for Learning Revenue-Maximizing Two-Part Tariffs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019

Learning Time Dependent Choice.

[BibT_eX]

[DOI]

Zachary Chase