research
∙
06/20/2023
Composition of nested embeddings with an application to outlier removal
We study the design of embeddings into Euclidean space with outliers. Gi...
share
research
∙
04/04/2023
Online Time-Windows TSP with Predictions
In the Time-Windows TSP (TW-TSP) we are given requests at different loca...
research
∙
04/08/2022
Individually-Fair Auctions for Multi-Slot Sponsored Search
We design fair sponsored search auctions that achieve a near-optimal tra...
research
∙
04/05/2022
Buy-Many Mechanisms for Many Unit-Demand Buyers
A recent line of research has established a novel desideratum for design...
research
∙
03/31/2022
To ArXiv or not to ArXiv: A Study Quantifying Pros and Cons of Posting Preprints Online
Double-blind conferences have engaged in debates over whether to allow a...
research
∙
03/31/2022
Cite-seeing and Reviewing: A Study on Citation Bias in Peer Review
Citations play an important role in researchers' careers as a key factor...
research
∙
08/30/2021
Approximating Pandora's Box with Correlations
The Pandora's Box problem asks to find a search strategy over n alternat...
research
∙
07/06/2021
Visions in Theoretical Computer Science: A Report on the TCS Visioning Workshop 2020
Theoretical computer science (TCS) is a subdiscipline of computer scienc...
research
∙
06/08/2021
Pricing Ordered Items
We study the revenue guarantees and approximability of item pricing. Rec...
research
∙
11/18/2020
Non-Adaptive Matroid Prophet Inequalities
We investigate non-adaptive algorithms for matroid prophet inequalities....
research
∙
07/15/2020
Static pricing for multi-unit prophet inequalities
We study a pricing problem where a seller has k identical copies of a pr...
research
∙
03/31/2020
Fairness in ad auctions through inverse proportionality
We study the tradeoff between social welfare maximization and fairness i...
research
∙
03/24/2020
Menu-size Complexity and Revenue Continuity of Buy-many Mechanisms
We study the multi-item mechanism design problem where a monopolist sell...
research
∙
11/05/2019
Learning Optimal Search Algorithms from Data
Classical algorithm design is geared towards worst case instances and fa...
research
∙
09/02/2019
Revenue Maximization for Query Pricing
Buying and selling of data online has increased substantially over the l...
research
∙
07/02/2019
Themis: Fair and Efficient GPU Cluster Scheduling for Machine Learning Workloads
Modern distributed machine learning (ML) training workloads benefit sign...
research
∙
06/20/2019
Multi-Category Fairness in Sponsored Search Auctions
Fairness in advertising is a topic of particular concern motivated by th...
research
∙
06/20/2019
Individual Fairness in Sponsored Search Auctions
Fairness in advertising is a topic of particular interest in both the co...
research
∙
02/27/2019
Buy-many mechanisms are not much better than item pricing
Multi-item mechanisms can be very complex offering many different bundle...
research
∙
02/27/2019
Reasonable multi-item mechanisms are not much better than item pricing
Multi-item mechanisms can be very complex offering many different bundle...
research
∙
08/15/2017
Mechanism Redesign
This paper develops the theory of mechanism redesign by which an auction...
research
∙
07/31/2017
