activity
20152021
most citedA Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model

4 citations · 6 across the 9 of their papers we have counts for

collaborators
Showing 2019Show all

6 papers · 1 filter

cs.DS2019

Pan-Private Uniformity Testing

Kareem Amin, Matthew Joseph, Jieming Mao

A centrally differentially private algorithm maps raw data to differentially private outputs. In contrast, a locally differentially private algorithm may only access data through p…

cs.LG2019

Exponential Separations in Local Differential Privacy

Matthew Joseph, Jieming Mao, Aaron Roth

We prove a general connection between the communication complexity of two-player games and the sample complexity of their multi-player locally private analogues. We use this connec…

cs.DS2019

Sorted Top-k in Rounds

Mark Braverman, Jieming Mao, Yuval Peres

We consider the sorted top- problem whose goal is to recover the top- items with the correct order out of items using pairwise comparisons. In many applications, multiple…

cs.GT2019

Diversity and Exploration in Social Learning

Nicole Immorlica, Jieming Mao, Christos Tzamos

In consumer search, there is a set of items. An agent has a prior over her value for each item and can pay a cost to learn the instantiation of her value. After exploring a subset…

cs.LG2019

The Role of Interactivity in Local Differential Privacy

Matthew Joseph, Jieming Mao, Seth Neel +1

We study the power of interactivity in local differential privacy. First, we focus on the difference between fully interactive and sequentially interactive protocols. Sequentially…

cs.GT20191 cited

Bayesian Exploration with Heterogeneous Agents

Nicole Immorlica, Jieming Mao, Aleksandrs Slivkins +1

It is common in recommendation systems that users both consume and produce information as they make strategic choices under uncertainty. While a social planner would balance "explo…