New Possibilities for Fair Algorithms

Philosophy and Technology 37 (4):1-17 (2024)
  Copy   BIBTEX

Abstract

We introduce a fairness criterion that we call Spanning. Spanning i) is implied by Calibration, ii) retains interesting properties of Calibration that some other ways of relaxing that criterion do not, and iii) unlike Calibration and other prominent ways of weakening it, is consistent with Equalized Odds outside of trivial cases.

Author Profiles

Michael Nielsen
University of Sydney
Rush T. Stewart
University of Rochester

Analytics

Added to PP
2024-09-20

Downloads
148 (#92,398)

6 months
148 (#24,975)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?