Search Results for author: Brian Brubach

Found 8 papers, 1 papers with code

Fair Labeled Clustering

no code implementations28 May 2022 Seyed A. Esmaeili, Sharmila Duppala, John P. Dickerson, Brian Brubach

To ensure group fairness in such a setting, we would desire proportional group representation in every label but not necessarily in every cluster as is done in group fair clustering.

Clustering Fairness

Implications of Distance over Redistricting Maps: Central and Outlier Maps

no code implementations2 Mar 2022 Seyed A. Esmaeili, Darshan Chakrabarti, Hayley Grape, Brian Brubach

Specifically, we define a central map which may be considered as being "most typical" and give a rigorous justification for it by showing that it mirrors the Kemeny ranking in a scenario where we have a committee voting over a collection of redistricting maps to be drawn.

Fairness Outlier Detection +1

Fair Clustering Under a Bounded Cost

no code implementations NeurIPS 2021 Seyed A. Esmaeili, Brian Brubach, Aravind Srinivasan, John P. Dickerson

We derive fundamental lower bounds on the approximation of the utilitarian and egalitarian objectives and introduce algorithms with provable guarantees for them.

Clustering Fairness

Stochastic Optimization and Learning for Two-Stage Supplier Problems

no code implementations7 Aug 2020 Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti

The main focus of this paper is radius-based (supplier) clustering in the two-stage stochastic setting with recourse, where the inherent stochasticity of the model comes in the form of a budget constraint.

Data Structures and Algorithms

Probabilistic Fair Clustering

no code implementations NeurIPS 2020 Seyed A. Esmaeili, Brian Brubach, Leonidas Tsepenekas, John P. Dickerson

In fair clustering problems, vertices are endowed with a color (e. g., membership in a group), and the features of a valid clustering might also include the representation of colors in that clustering.

Clustering valid

Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts

no code implementations22 Apr 2018 Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu

On the upper bound side, we show that this framework, combined with a black-box adapted from Bansal et al., (Algorithmica, 2012), yields an online algorithm which nearly doubles the ratio to 0. 46.

Cannot find the paper you are looking for? You can Submit a new open access paper.