research
∙
08/25/2023
Optimizing Group-Fair Plackett-Luce Ranking Models for Relevance and Ex-Post Fairness
In learning-to-rank (LTR), optimizing only the relevance (or the expecte...
share
research
∙
06/21/2023
Sampling Individually-Fair Rankings that are Always Group Fair
Rankings on online platforms help their end-users find the relevant info...
research
∙
12/27/2022
Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes
There are a lot of recent works on generalizing the spectral theory of g...
research
∙
08/24/2022
Matchings Under Diversity Constraints
Matching problems with group fairness constraints have numerous applicat...
research
∙
08/22/2022
Socially Fair Center-based and Linear Subspace Clustering
Center-based clustering (e.g., k-means, k-medians) and clustering using ...
research
∙
08/21/2022
Bipartite Matchings with Group Fairness and Individual Fairness Constraints
We address group as well as individual fairness constraints in matchings...
research
∙
05/23/2022
Approximating CSPs with Outliers
Constraint satisfaction problems (CSPs) are ubiquitous in theoretical co...
research
∙
03/02/2022
Sampling Random Group Fair Rankings
In this paper, we consider the problem of randomized group fair ranking ...
research
∙
05/20/2021
Matchings with Group Fairness Constraints: Online and Offline Algorithms
We consider the problem of assigning items to platforms in the presence ...
research
∙
04/02/2021
Independent Sets in Semi-random Hypergraphs
A set of vertices in a hypergraph is called an independent set if no hyp...
research
∙
09/24/2020
Ranking for Individual and Group Fairness Simultaneously
Search and recommendation systems, such as search engines, recruiting to...
research
∙
07/14/2020
Robust Identifiability in Linear Structural Equation Models of Causal Inference
In this work, we consider the problem of robust parameter estimation fro...
research
∙
06/14/2020
Group Fairness for Knapsack Problems
We study the knapsack problem with group fairness constraints. The input...
research
∙
05/18/2020
Approximation Algorithms and Hardness for Strong Unique Games
The UNIQUE GAMES problem is a central problem in algorithms and complexi...
research
∙
04/29/2020
Planted Models for the Densest k-Subgraph Problem
Given an undirected graph G, the Densest k-subgraph problem (DkS) asks t...
research
∙
03/12/2020
On the Complexity of λ_∞ , Vertex Expansion, and Spread Constant of Trees
Bobkov, Houdré, and the last author introduced a Poincaré-type functiona...
research
∙
10/20/2019
Planted Models for k-way Edge and Vertex Expansion
Graph partitioning problems are a central topic of study in algorithms a...
research
∙
08/30/2019
Approximation Algorithms for Partially Colorable Graphs
Graph coloring problems are a central topic of study in the theory of al...
research
∙
05/16/2019
Stability of Linear Structural Equation Models of Causal Inference
We consider the numerical stability of the parameter recovery problem in...
research
∙
09/07/2018
HyperGCN: Hypergraph Convolutional Networks for Semi-Supervised Classification
Graph-based semi-supervised learning (SSL) is an important learning prob...
research
∙
05/24/2018
Semi-Random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery
The problem of computing the vertex expansion of a graph is an NP-hard p...
research
∙
04/28/2018
