A Unified Approach to Quantifying Algorithmic Unfairness: Measuring Individual & Group Unfairness via Inequality Indices
Till Speicher (1), Hoda Heidari (2), Nina Grgic-Hlaca (1), Krishna P., Gummadi (1), Adish Singla (1), Adrian Weller (3, 4), Muhammad Bilal Zafar, (1) ((1) MPI-SWS, (2) ETH Zurich, (3) University of Cambridge, (4) The Alan, Turing Institute)

TL;DR
This paper introduces a unified framework using economic inequality indices to measure and compare individual and group unfairness in algorithms, revealing tradeoffs between fairness notions and accuracy.
Contribution
It proposes a general, justified method to quantify and compare algorithmic unfairness at both individual and group levels using inequality indices.
Findings
Inequality indices can effectively measure algorithmic unfairness.
Minimizing between-group unfairness alone may increase overall unfairness.
Tradeoffs exist between fairness measures and prediction accuracy.
Abstract
Discrimination via algorithmic decision making has received considerable attention. Prior work largely focuses on defining conditions for fairness, but does not define satisfactory measures of algorithmic unfairness. In this paper, we focus on the following question: Given two unfair algorithms, how should we determine which of the two is more unfair? Our core idea is to use existing inequality indices from economics to measure how unequally the outcomes of an algorithm benefit different individuals or groups in a population. Our work offers a justified and general framework to compare and contrast the (un)fairness of algorithmic predictors. This unifying approach enables us to quantify unfairness both at the individual and the group level. Further, our work reveals overlooked tradeoffs between different fairness notions: using our proposed measures, the overall individual-level…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
