5 citations · 10 across the 8 of their papers we have counts for
8 papers
Proportionally Fair Matching via Randomized Rounding
Sharmila Duppala, Nathaniel Grammel, Juan Luque +2
Given an edge-colored graph, the goal of the proportional fair matching problem is to find a maximum weight matching while ensuring proportional representation (with respect to the…
Barter Exchange with Shared Item Valuations
Juan Luque, Sharmila Duppala, John Dickerson +1
In barter exchanges agents enter seeking to swap their items for other items on their wishlist. We consider a centralized barter exchange with a set of agents and items where each…
Robust Fair Clustering with Group Membership Uncertainty Sets
Sharmila Duppala, Juan Luque, John P. Dickerson +1
We study the canonical fair clustering problem where each cluster is constrained to have close to population-level representation of each group. Despite significant attention, the…
Concentration of Submodular Functions and Read-k Families Under Negative Dependence
Sharmila Duppala, George Z. Li, Juan Luque +2
We study the question of whether submodular functions of random variables satisfying various notions of negative dependence satisfy Chernoff-like concentration inequalities. We pro…
Fair Labeled Clustering
Seyed A. Esmaeili, Sharmila Duppala, John P. Dickerson +1
Numerous algorithms have been produced for the fundamental problem of clustering under many different notions of fairness. Perhaps the most common family of notions currently studi…
Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individual
Seyed A. Esmaeili, Sharmila Duppala, Davidson Cheng +3
Online bipartite-matching platforms are ubiquitous and find applications in important areas such as crowdsourcing and ridesharing. In the most general form, the platform consists o…
Online minimum matching with uniform metric and random arrivals
Sharmila Duppala, Karthik A. Sankararaman, Pan Xu
We consider Online Minimum Bipartite Matching under the uniform metric. We show that Randomized Greedy achieves a competitive ratio equal to , which matches th…
Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths
Rathish Das, Shih-Yu Tsai, Sharmila Duppala +5
A determinacy race occurs if two or more logically parallel instructions access the same memory location and at least one of them tries to modify its content. Races often lead to n…