7 citations · 16 across the 9 of their papers we have counts for
12 papers
Auctions with Price Predictions
Muthu Sundar, Alec Sun, Siddharth Prasad +1
We design auctions for the sale of a single item with unlimited supply given a single prediction of the revenue-maximizing uniform price. This departs from prior work on auctions w…
Revenue-Optimal Efficient Mechanism Design with General Type Spaces
Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm
We derive the revenue-optimal efficient (welfare-maximizing) mechanism in a general multidimensional mechanism design setting when type spaces -- that is, the underlying domains fr…
Weakest Bidder Types and New Core-Selecting Combinatorial Auctions
Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm
Core-selecting combinatorial auctions are popular auction designs that constrain prices to eliminate the incentive for any group of bidders -- with the seller -- to renegotiate for…
New Sequence-Independent Lifting Techniques for Cutting Planes and When They Induce Facets
Siddharth Prasad, Ellen Vitercik, Maria-Florina Balcan +1
Sequence-independent lifting is a procedure for strengthening valid inequalities of an integer program. We generalize the sequence-independent lifting method of Gu, Nemhauser, and…
Bicriteria Multidimensional Mechanism Design with Side Information
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm
We develop a versatile methodology for multidimensional mechanism design that incorporates side information about agents to generate high welfare and high revenue simultaneously. S…
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…
Improved Sample Complexity Bounds for Branch-and-Cut
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm +1
Branch-and-cut is the most widely used algorithm for solving integer programs, employed by commercial solvers like CPLEX and Gurobi. Branch-and-cut has a wide variety of tunable pa…
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…
New Properties of Numbers of Plane Graphs
Siddharth Prasad
We explore various techniques for counting the number of straight-edge crossing-free graphs that can be embedded on a planar point set. In particular, we derive a lower bound on th…
Walks on Primes in Imaginary Quadratic Fields
Siddharth Prasad
We generalize the Gaussian moat problem to the finitely many imaginary quadratic fields exhibiting unique factorization in their integers. We map this problem to the Euclidean mini…