New Optimal Transport method ensures group fairness in matching

Researchers have developed a new framework for ensuring fairness in matching algorithms, specifically within the context of Optimal Transport (OT). Their work introduces a novel group fairness constraint that targets the probability of matches between individuals from different groups. The study proposes a modified Sinkhorn algorithm for efficient computation of perfectly fair plans and explores relaxation strategies to balance fairness with matching quality, including penalized OT and bilevel optimization. AI

影响 Introduces a novel algorithmic approach to fairness in matching, potentially impacting resource allocation systems.

排序理由 This is a research paper detailing a new algorithmic approach to a specific problem in machine learning. [lever_c_demoted from research: ic=1 ai=1.0]

在 arXiv stat.ML 阅读 →

• Mathieu Dagréou

• 论文
• 安全

AI 生成摘要 · Google Gemini · 来自 1 个来源。 我们如何撰写摘要 →