Matching code and law: achieving algorithmic fairness with optimal transport

DOI10.1007/s10618-019-00658-8zbMath1458.68190arXiv1712.07924OpenAlexW2985745615WikidataQ114690137 ScholiaQ114690137MaRDI QIDQ2218406

Meike Zehlike, Philipp Hacker, Emil Wiedemann

Publication date: 15 January 2021

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.07924

zbMATH Keywords

fair distributionoptimal transportalgorithmic fairnessstatistical paritytradeoff between individual and group fairness

Mathematics Subject Classification ID

Applications of statistics to social sciences (62P25) Learning and adaptive systems in artificial intelligence (68T05) Mathematical sociology (including anthropology) (91D99) Optimal transportation (49Q22)

Uses Software

• GitHub
• POT
• LETOR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for removing sensitive information: application to race-independent recidivism prediction
• Fairness through awareness
• Barycenters in the Wasserstein Space
• Polar factorization and monotone rearrangement of vector‐valued functions

This page was built for publication: Matching code and law: achieving algorithmic fairness with optimal transport