1 citations · 2 across the 9 of their papers we have counts for
3 papers · 1 filter
The Binary Tree Mechanism is Optimal for Differentially Private Continual Counting
Konstantina Bairaktari, Kasper Green Larsen, Markus Engelund Dahl
Private continual counting is a fundamental problem in differential privacy: given a binary stream of length , where each corresponds to the contribution of one individual,…
Fair and Optimal Cohort Selection for Linear Utilities
Konstantina Bairaktari, Huy Le Nguyen, Jonathan Ullman
The rise of algorithmic decision-making has created an explosion of research around the fairness of those algorithms. While there are many compelling notions of individual fairness…
Fair and Useful Cohort Selection
Konstantina Bairaktari, Paul Langton, Huy L. Nguyen +2
A challenge in fair algorithm design is that, while there are compelling notions of individual fairness, these notions typically do not satisfy desirable composition properties, an…