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 ...