← Search

Marina Knittel

5 accepted papers

2023

Fair, Polylog-Approximate Low-Cost Hierarchical Clustering

NeurIPS 2023poster

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. Ahmadian et al. [2020] established the study of fairness in hierarchical clustering, a stronger, more structured variant o…

Cited by 3SourcePDFScholar
2023

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

ICML 2023poster

Clustering is a fundamental building block of modern statistical analysis pipelines. Fair clustering has seen much attention from the machine learning community in recent years. We are some of the first to study fairness in the context of hierarchical clustering, after the results of Ahmadian et al.…

Cited by 4SourcePDFScholar
2022

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

IJCAI 2022poster

While the stable marriage problem and its variants model a vast range of matching markets, they fail to capture complex agent relationships, such as the affiliation of applicants and employers in an interview marketplace. To model this problem, the existing literature on matching with externalities…

Cited by 7SourcePDFScholar
2021

Scalable Equilibrium Computation in Multi-agent Influence Games on Networks

AAAI 2021technical

We provide a polynomial-time, scalable algorithm for equilibrium computation in multi-agent influence games on networks, extending work of Bindel, Kleinberg, and Oren (2015) from the single-agent to the multi-agent setting. In games of influence, agents have limited advertising budget to influence t…

Cited by 3SourcePDFScholar