Siddharth Prasad

22 papers A* 9A 3Journal 10

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Weakest Bidder Types and New Core-Selecting Combinatorial Auctions. AAAI Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm
2025	A*	`conf`	Increasing Revenue in Efficient Combinatorial Auctions by Learning to Generate Artificial Competition. AAAI Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm
2025	A*	`conf`	New Sequence-Independent Lifting Techniques for Cover Inequalities and When They Induce Facets. IJCAI Siddharth Prasad, Ellen Vitercik, Maria-Florina Balcan, Tuomas Sandholm
2025	J	`jnl`	Revenue-Optimal Efficient Mechanism Design with General Type Spaces. CoRR Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm
2025	J	`jnl`	Weakest Bidder Types and New Core-Selecting Combinatorial Auctions. CoRR Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm
2024	J	`jnl`	New Sequence-Independent Lifting Techniques for Cutting Planes and When They Induce Facets. CoRR Siddharth Prasad, Ellen Vitercik, Maria-Florina Balcan, Tuomas Sandholm
2023	A*	`conf`	Bicriteria Multidimensional Mechanism Design with Side Information. NeurIPS Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm
2023	J	`jnl`	Bicriteria Multidimensional Mechanism Design with Side Information. CoRR Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm
2023	J	`jnl`	Content Prompting: Modeling Content Provider Dynamics to Improve User Welfare in Recommender Ecosystems. CoRR Siddharth Prasad, Martin Mladenov, Craig Boutilier
2022	A	`conf`	Improved Sample Complexity Bounds for Branch-And-Cut. CP Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik
2022	A*	`conf`	Maximizing Revenue under Market Shrinkage and Market Uncertainty. NeurIPS Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm
2022	A*	`conf`	Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts. NeurIPS Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik
2022	J	`jnl`	Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts. CoRR Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik
2021	J	`jnl`	Improved Learning Bounds for Branch-and-Cut. CoRR Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik
2021	A*	`conf`	Learning Within an Instance for Designing High-Revenue Combinatorial Auctions. IJCAI Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm
2021	A*	`conf`	Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond. NeurIPS Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik
2021	J	`jnl`	Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond. CoRR Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik
2020	A*	`conf`	Efficient Algorithms for Learning Revenue-Maximizing Two-Part Tariffs. IJCAI Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm
2020	A	`conf`	Incentive Compatible Active Learning. ITCS Federico Echenique, Siddharth Prasad
2019	J	`jnl`	Incentive Compatible Active Learning. CoRR Federico Echenique, Siddharth Prasad
2019	A	`conf`	Learning Time Dependent Choice. ITCS Zachary Chase, Siddharth Prasad
2018	J	`jnl`	Learning Time Dependent Choice. CoRR Zachary Chase, Siddharth Prasad