Siddharth Prasad

According to our database, Siddharth Prasad authored at least 17 papers between 2019 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2026

In-Context Credit Assignment via the Core.

Keegan Harris, Siddharth Prasad, Asher Trockman

CoRR, May, 2026

Weakest Bidder Types and New Core-Selecting Combinatorial Auctions.

Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm

Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025

Revenue-Optimal Efficient Mechanism Design with General Type Spaces.

Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm

CoRR, May, 2025

New Sequence-Independent Lifting Techniques for Cover Inequalities and When They Induce Facets.

Siddharth Prasad, Ellen Vitercik, Maria-Florina Balcan, Tuomas Sandholm

Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

Increasing Revenue in Efficient Combinatorial Auctions by Learning to Generate Artificial Competition.

Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm

Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

2024

New Sequence-Independent Lifting Techniques for Cutting Planes and When They Induce Facets.

Siddharth Prasad, Ellen Vitercik, Maria-Florina Balcan, Tuomas Sandholm

CoRR, 2024

2023

Content Prompting: Modeling Content Provider Dynamics to Improve User Welfare in Recommender Ecosystems.

Siddharth Prasad, Martin Mladenov, Craig Boutilier

CoRR, 2023

Bicriteria Multidimensional Mechanism Design with Side Information.

Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm

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.

Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik

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.

Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm

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.

Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik

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

2021

Improved Learning Bounds for Branch-and-Cut.

Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik

CoRR, 2021

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

Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik

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.

Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm

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

2020

Incentive Compatible Active Learning.

Federico Echenique, Siddharth Prasad

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

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

Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm

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

2019

Learning Time Dependent Choice.

Zachary Chase, Siddharth Prasad

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019