Sharmila Duppala


Sharmila Duppala
PhD Student
University of Maryland, College Park

sduppala [at] umd.edu
sduppala [at] cs.umd.edu

I am a Ph.D. student in the Computer Science department at the University of Maryland, College Park, where I am fortunate to be co-advised by professors Aravind Srinivasan and John P. Dickerson. Prior to that, I was a Graduate Research Assistant at the Computer Science department in Stony Brook University where I was very lucky to be advised by Prof. Rezaul Chowdhury and my Masters thesis was focussed on reusable resource-allocation problem.

My current research spans Randomized Algorithms, Probabilistic Models and Fairness. My interests broadly focus in two directions :
(1) Algorithms for online stochastic matching models: Specifically, design and competitive analysis of algorithms under different online stochastic settings like KIID (Known IID distribution arrivals) and Random Order Arrivals.
(2) Algorithmic fairness in combinatorial optimization: Understanding the algorithmic challenges of incorporating "acceptable" and "meaningful" notions of fairness into stochastic and combinatorial optimization problems arising in ride-sharing, internet advertising, crowdsourcing markets, kidney-exchange markets, etc. Further, I am interested in understanding the merits and limitations of the fairness criteria in providing solutions to the underlying optimization problem.

News

Papers

Simultaneous Individual and Group Fairness in Set Covering Problems
Under submission, January 2024
Robust Fair Clustering with Group Membership Uncertainty Sets
Under submission, January 2024
Probabilistic Proportionally Fair Matching
Under submission, January 2024
Barter Exchange with Shared Item Valuations
The Web Conference 2024, January 2024
Concentration of Submodular Functions Under Negative Dependence
In preparation, September 2023
Group Fairness in Set Packing Problems
IJCAI 2023, April 2023
Rawlsian Fairness in Online Bipartite Matching, Two-sided, Group and Individual
AAAI 2023, December 2022
Fair Labeled Clustering
KDD 2022, May 2022
Rawlsian Fairness in Online Bipartite Matching, Two-sided, Group and Individual
AAMAS 2022 Extended Abstract, January 2022
Online minimum matching with uniform metric and random arrivals
Operation Research Letters 2022, January 2022
Improved MapReduce Load Balancing through Distribution-Dependent Hash Function Optimization
ICPADS 2021, December 2020
Data races and the discrete resource-time tradeoff problem with resource reuse over paths.
SPAA 2019, June 2019

Personal, but work related

Running

I love running! I registered for my first official half-marathon, the Rock ‘n’ Roll Half-Marathon at Washington D.C. on March 18, 2023.

Bouldering Competition

I competed in my first bouldering competition in Spring 2022 at Purdue Boulder Up! in Women’s Beginner division (V0-V3).

Inclusivity & Engagement
  • I volunteered and co-designed (along with Arghya Sadhukhan) introductory material on group theory for high school girls at Girls Talk Math during the Summer of 2021.
  • I co-organized CATS (Captial Area Theory Seminar) at University of Maryland, College Park with Nathaniel Grammel during Fall 2021 and Spring 2022.