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 All
Our first result is a polynomial-time algorithm that computes a distribution over `group-fair' matchings such that the individual fairness constraints are approximately satisfied and the expected size of a matching is close to OPT.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
