12 citations · 13 across the 2 of their papers we have counts for
3 papers
cs.LG2021★ 1 cited
Maxmin-Fair Ranking: Individual Fairness under Group-Fairness Constraints
David Garcia-Soriano, Francesco Bonchi
We study a novel problem of fairness in ranking aimed at minimizing the amount of individual unfairness introduced when enforcing group-fairness constraints. Our proposal is rooted…
cs.DS2018
Fair-by-design matching
David García-Soriano, Francesco Bonchi
Matching algorithms are used routinely to match donors to recipients for solid organs transplantation, for the assignment of medical residents to hospitals, record linkage in datab…
cs.SI2017★ 12 cited
To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem
Natali Ruchansky, Francesco Bonchi, David Garcia-Soriano +2
We study the problem of extracting a selective connector for a given set of query vertices in a graph . A selective connector is a subgraph of which…