Inherent Trade-Offs in the Fair Determination of Risk Scores

By Jon M. Kleinberg, Sendhil Mullainathan, Manish Raghavan. 2016

2,087 citations recorded by the source corpus.

Recent discussion in the public sphere about algorithmic classification has involved tension between competing notions of what it means for a probabilistic classification to be fair to different groups. We formalize three fairness conditions that lie at the heart of these debates, and we prove that except in highly constrained special cases, there is no method that can satisfy these three conditions simultaneously. Moreover, even satisfying all three conditions approximately requires that the data lie in an approximate version of one of the constrained special cases identified by our theorem. These results suggest some of the ways in which key notions of fairness are incompatible with each other, and hence provide a framework for thinking about the trade-offs between them.

Subfields: Artificial Intelligence, History and Philosophy of Science, Safety, Robustness & Interpretability

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Percy Liang
  2. Mohit Bansal
  3. Yoshua Bengio
  4. Sergey Levine
  5. Quoc V. Le
  6. Jianfeng Gao
  7. Ruslan Salakhutdinov
  8. Yejin Choi

In History and Philosophy of Science

  1. Susan Athey
  2. Aaron Roth
  3. Ben Green
  4. Alexandra Chouldechova
  5. Krishna P. Gummadi
  6. Reuben Binns
  7. Michael Kearns
  8. Adrian Weller

In Safety, Robustness & Interpretability

  1. Silvia Chiappa
  2. Dana Pessach
  3. Erez Shmueli
  4. Percy Liang
  5. Adrian Weller
  6. Emilio Ferrara
  7. Aaron Roth
  8. Krishna P. Gummadi

Citations in the corpus