English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Paper

On Fairness, Diversity and Randomness in Algorithmic Decision Making

MPS-Authors
/persons/resource/persons204391

Grgić-Hlača,  Nina
Group K. Gummadi, Max Planck Institute for Software Systems, Max Planck Society;

/persons/resource/persons145105

Zafar,  Muhammad Bilal
Group K. Gummadi, Max Planck Institute for Software Systems, Max Planck Society;

/persons/resource/persons144524

Gummadi,  Krishna
Group K. Gummadi, Max Planck Institute for Software Systems, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

arXiv:1706.10208.pdf
(Preprint), 517KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Grgić-Hlača, N., Zafar, M. B., Gummadi, K., & Weller, A. (2017). On Fairness, Diversity and Randomness in Algorithmic Decision Making. Retrieved from http://arxiv.org/abs/1706.10208.


Cite as: https://hdl.handle.net/21.11116/0000-0000-DE3C-4
Abstract
Consider a binary decision making process where a single machine learning classifier replaces a multitude of humans. We raise questions about the resulting loss of diversity in the decision making process. We study the potential benefits of using random classifier ensembles instead of a single classifier in the context of fairness-aware learning and demonstrate various attractive properties: (i) an ensemble of fair classifiers is guaranteed to be fair, for several different measures of fairness, (ii) an ensemble of unfair classifiers can still achieve fair outcomes, and (iii) an ensemble of classifiers can achieve better accuracy-fairness trade-offs than a single classifier. Finally, we introduce notions of distributional fairness to characterize further potential benefits of random classifier ensembles.