2 code implementations • 20 Jun 2017 • Meike Zehlike, Francesco Bonchi, Carlos Castillo, Sara Hajian, Mohamed Megahed, Ricardo Baeza-Yates
In this work, we define and solve the Fair Top-k Ranking problem, in which we want to determine a subset of k candidates from a large pool of n >> k candidates, maximizing utility (i. e., select the "best" candidates) subject to group fairness criteria.
no code implementations • 2 Oct 2015 • Francesco Bonchi, Sara Hajian, Bud Mishra, Daniele Ramazzotti
Discrimination discovery from data is an important task aiming at identifying patterns of illegal and unethical discriminatory activities against protected-by-law groups, e. g., ethnic minorities.