
Shuffle Private Stochastic Convex Optimization
In shuffle privacy, each user sends a collection of randomized messages ...
read it

Interactive Communication in Bilateral Trade
We define a model of interactive communication where two agents with pri...
read it

Optimal Pricing Schemes for an Impatient Buyer
A patient seller aims to sell a good to an impatient buyer (i.e., one wh...
read it

Towards Efficient Auctions in an Autobidding World
Autobidding has become one of the main options for bidding in online ad...
read it

Connecting Robust Shuffle Privacy and PanPrivacy
In the shuffle model of differential privacy, dataholding users send ra...
read it

PanPrivate Uniformity Testing
A centrally differentially private algorithm maps raw data to differenti...
read it

Exponential Separations in Local Differential Privacy Through Communication Complexity
We prove a general connection between the communication complexity of tw...
read it

Sorted Topk in Rounds
We consider the sorted topk problem whose goal is to recover the topk ...
read it

Diversity and Exploration in Social Learning
In consumer search, there is a set of items. An agent has a prior over h...
read it

The Role of Interactivity in Local Differential Privacy
We study the power of interactivity in local differential privacy. First...
read it

Bayesian Exploration with Heterogeneous Agents
It is common in recommendation systems that users both consume and produ...
read it

Differentially Private Fair Learning
We design two learning algorithms that simultaneously promise differenti...
read it

Locally Private Gaussian Estimation
We study a basic private estimation problem: each of n users draws a sin...
read it

Incentivizing Exploration with Unbiased Histories
In a social learning setting, there is a set of actions, each of which h...
read it

Selling to a NoRegret Buyer
We consider the problem of a single seller repeatedly selling a single i...
read it

Combinatorial Assortment Optimization
Assortment optimization refers to the problem of designing a slate of pr...
read it

A Nearly Instance Optimal Algorithm for Topk Ranking under the Multinomial Logit Model
We study the active learning problem of topk ranking from multiwise co...
read it

Multiarmed Bandit Problems with Strategic Arms
We study a strategic version of the multiarmed bandit problem, where ea...
read it

Competitive analysis of the topK ranking problem
Motivated by applications in recommender systems, web search, social cho...
read it
Jieming Mao
is this you? claim profile