Search Results for author:
Found 1 papers, 1 papers with code
Individual fairness under Varied Notions of Group Fairness in Bipartite Matching -- One Framework to Approximate Them Al
When each item can belong to multiple groups, the problem of finding a maximum size group-fair matching is NP-hard even when all the group lower bounds are 0, and there are no individual fairness constraints.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
