10 citations · 11 across the 5 of their papers we have counts for
6 papers
An Efficient Algorithm for Fair Multi-Agent Multi-Armed Bandit with Low Regret
Matthew Jones, Huy Lê Nguyen, Thy Nguyen
Recently a multi-agent variant of the classical multi-armed bandit was proposed to tackle fairness issues in online learning. Inspired by a long line of work in social choice and e…
Fair Range k-center
Huy Lê Nguyen, Thy Nguyen, Matthew Jones
We study the problem of fairness in k-centers clustering on data with disjoint demographic groups. Specifically, this work proposes a variant of fairness which restricts each group…
Locally Private -Means Clustering with Constant Multiplicative Approximation and Near-Optimal Additive Error
Anamay Chaturvedi, Matthew Jones, Huy L. Nguyen
Given a data set of size in -dimensional Euclidean space, the -means problem asks for a set of points (called centers) so that the sum of the -distances be…
Differentially Private Clustering via Maximum Coverage
Matthew Jones, Huy Lê Nguyen, Thy Nguyen
This paper studies the problem of clustering in metric spaces while preserving the privacy of individual data. Specifically, we examine differentially private variants of the k-med…
Reconfiguration of Connected Graph Partitions
Hugo A. Akitaya, Matthew D. Jones, Matias Korman +5
Motivated by recent computational models for redistricting and detection of gerrymandering, we study the following problem on graph partitions. Given a graph and an integer $k\…
Maximum Area Axis-Aligned Square Packings
Hugo A. Akitaya, Matthew D. Jones, David Stalfa +1
Given a point set in the unit square , an anchored square packing is a set of interior-disjoint empty squares in such that is a co…