FA*IR

2017466 citationsPreprintgreen Open Access

Authors

Meike Zehlike · Technische Universität Berlin

Francesco Bonchi · Institute for Scientific Interchange

Carlos Castillo · Pompeu Fabra University

Sara Hajian

M. Megahed · Technische Universität Berlin

Ricardo Baeza‐Yates · Pompeu Fabra University

Abstract

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.

Topics & Keywords

Ethics and Social Impacts of AI Privacy-Preserving Technologies in Data Game Theory and Voting Systems

Publication Details

DOI: 10.1145/3132847.3132938

Field-Weighted Citation Impact: 51.80

Command Palette

FA*IR

Authors

Abstract

Topics & Keywords

Publication Details