3 citations · 4 across the 8 of their papers we have counts for
6 papers · 1 filter
Socially Fair Center-based and Linear Subspace Clustering
Sruthi Gorantla, Kishen N. Gowda, Amit Deshpande +1
Center-based clustering (e.g., -means, -medians) and clustering using linear subspaces are two most popular techniques to partition real-world data into smaller clusters. How…
Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints
Anand Louis, Meghana Nasre, Prajakta Nimbhorkar +1
Matching problems with group-fairness constraints and diversity constraints have numerous applications such as in allocation problems, committee selection, school choice, etc. More…
Individual Fairness under Varied Notions of Group Fairness in Bipartite Matching - One Framework to Approximate Them All
Atasi Panda, Anand Louis, Prajakta Nimbhorkar
We study the probabilistic assignment of items to platforms that satisfies both group and individual fairness constraints. Each item belongs to specific groups and has a preference…
Approximating CSPs with Outliers
Suprovat Ghoshal, Anand Louis
Constraint satisfaction problems (CSPs) are ubiquitous in theoretical computer science. We study the problem of StrongCSPs, i.e. instances where a large induced sub-instance has a…
Exact recovery algorithm for Planted Bipartite Graph in Semi-random Graphs
Akash Kumar, Anand Louis, Rameesh Paul
The problem of finding the largest induced balanced bipartite subgraph in a given graph is NP-hard. This problem is closely related to the problem of finding the smallest Odd Cycle…
Sampling Ex-Post Group-Fair Rankings
Sruthi Gorantla, Amit Deshpande, Anand Louis
Randomized rankings have been of recent interest to achieve ex-ante fairer exposure and better robustness than deterministic rankings. We propose a set of natural axioms for random…