Search Results for author: Marina Knittel

Found 4 papers, 0 papers with code

Fair Polylog-Approximate Low-Cost Hierarchical Clustering

no code implementations21 Nov 2023 Marina Knittel, Max Springer, John Dickerson, Mohammadtaghi Hajiaghayi

Research in fair machine learning, and particularly clustering, has been crucial in recent years given the many ethical controversies that modern intelligent systems have posed.

Clustering Fairness

Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost

no code implementations27 May 2022 Marina Knittel, Max Springer, John P. Dickerson, Mohammadtaghi Hajiaghayi

We evaluate our results using Dasgupta's cost function, perhaps one of the most prevalent theoretical metrics for hierarchical clustering evaluation.

Clustering Fairness

The Dichotomous Affiliate Stable Matching Problem: Approval-Based Matching with Applicant-Employer Relations

no code implementations22 Feb 2022 Marina Knittel, Samuel Dooley, John P. Dickerson

We also assume the agent's preferences over entire matchings are determined by a general weighted valuation function of their (and their affiliates') matches.

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