7 citations · 11 across the 3 of their papers we have counts for
4 papers
Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm +1
The incorporation of cutting planes within the branch-and-bound algorithm, known as branch-and-cut, forms the backbone of modern integer programming solvers. These solvers are the…
Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm +1
Cutting-plane methods have enabled remarkable successes in integer programming over the last few decades. State-of-the-art solvers integrate a myriad of cutting-plane techniques to…
Incentive Compatible Active Learning
Federico Echenique, Siddharth Prasad
We consider active learning under incentive compatibility constraints. The main application of our results is to economic experiments, in which a learner seeks to infer the paramet…
Learning Time Dependent Choice
Zachary Chase, Siddharth Prasad
We explore questions dealing with the learnability of models of choice over time. We present a large class of preference models defined by a structural criterion for which we are a…