research
∙
05/25/2023
Learning across Data Owners with Joint Differential Privacy
In this paper, we study the setting in which data owners train machine l...
share
research
∙
02/01/2023
Autobidding Auctions in the Presence of User Costs
We study autobidding ad auctions with user costs, where each bidder is v...
research
∙
01/13/2023
Differentially Private Continual Releases of Streaming Frequency Moment Estimations
The streaming model of computation is a popular approach for working wit...
research
∙
08/22/2022
Efficiency of the First-Price Auction in the Autobidding World
We study the price of anarchy of the first-price auction in the autobidd...
research
∙
07/19/2022
Regret Minimization with Noisy Observations
In a typical optimization problem, the task is to pick one of a number o...
research
∙
11/05/2021
Approximately Efficient Bilateral Trade
We study bilateral trade between two strategic agents. The celebrated re...
research
∙
11/03/2021
Robust Auction Design in the Auto-bidding World
In classic auction theory, reserve prices are known to be effective for ...
research
∙
06/17/2021
Shuffle Private Stochastic Convex Optimization
In shuffle privacy, each user sends a collection of randomized messages ...
research
∙
06/03/2021
Interactive Communication in Bilateral Trade
We define a model of interactive communication where two agents with pri...
research
∙
06/03/2021
Optimal Pricing Schemes for an Impatient Buyer
A patient seller aims to sell a good to an impatient buyer (i.e., one wh...
research
∙
03/24/2021
Towards Efficient Auctions in an Auto-bidding World
Auto-bidding has become one of the main options for bidding in online ad...
research
∙
04/20/2020
Connecting Robust Shuffle Privacy and Pan-Privacy
In the shuffle model of differential privacy, data-holding users send ra...
research
∙
11/04/2019
Pan-Private Uniformity Testing
A centrally differentially private algorithm maps raw data to differenti...
research
∙
07/01/2019
Exponential Separations in Local Differential Privacy Through Communication Complexity
We prove a general connection between the communication complexity of tw...
research
∙
06/12/2019
Sorted Top-k in Rounds
We consider the sorted top-k problem whose goal is to recover the top-k ...
research
∙
05/13/2019
Diversity and Exploration in Social Learning
In consumer search, there is a set of items. An agent has a prior over h...
research
∙
04/07/2019
The Role of Interactivity in Local Differential Privacy
We study the power of interactivity in local differential privacy. First...
research
∙
02/19/2019
Bayesian Exploration with Heterogeneous Agents
It is common in recommendation systems that users both consume and produ...
research
∙
12/06/2018
Differentially Private Fair Learning
We design two learning algorithms that simultaneously promise differenti...
research
∙
11/20/2018
Locally Private Gaussian Estimation
We study a basic private estimation problem: each of n users draws a sin...
research
∙
11/14/2018
Incentivizing Exploration with Unbiased Histories
In a social learning setting, there is a set of actions, each of which h...
research
∙
11/25/2017
Selling to a No-Regret Buyer
We consider the problem of a single seller repeatedly selling a single i...
research
∙
11/07/2017
Combinatorial Assortment Optimization
Assortment optimization refers to the problem of designing a slate of pr...
research
∙
07/25/2017
A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model
We study the active learning problem of top-k ranking from multi-wise co...
research
∙
06/27/2017
Multi-armed Bandit Problems with Strategic Arms
We study a strategic version of the multi-armed bandit problem, where ea...
research
∙
05/12/2016