Govind S. Sankar — accepted AI-conference papers

2024

Individual Fairness in Graph Decomposition

ICML 2024spotlight

In this paper, we consider classic randomized low diameter decomposition procedures for planar graphs that obtain connected clusters that are cohesive in that close by pairs of nodes are assigned to the same cluster with high probability. We consider the additional aspect of *individual fairness* --…

Cited by 1 Source ↗PDF ↗Scholar ↗

2021

Matchings with Group Fairness Constraints: Online and Offline Algorithms

Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar

IJCAI 2021poster

We consider the problem of assigning items to platforms in the presence of group fairness constraints. In the input, each item belongs to certain categories, called classes in this paper. Each platform specifies the group fairness constraints through an upper bound on the number of items it can serv…

Cited by 27 Source ↗PDF ↗Scholar ↗