research
∙
09/11/2023
Concentration of Submodular Functions Under Negative Dependence
We study the question of whether submodular functions of random variable...
share
research
∙
10/24/2022
Improved Bi-point Rounding Algorithms and a Golden Barrier for k-Median
The current best approximation algorithms for k-median rely on first obt...
research
∙
02/16/2022
Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks
The spread of an epidemic is often modeled by an SIR random process on a...
research
∙
02/09/2022
Deploying Vaccine Distribution Sites for Improved Accessibility and Equity to Support Pandemic Response
In response to COVID-19, many countries have mandated social distancing ...
research
∙
01/16/2022
Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individual
Online bipartite-matching platforms are ubiquitous and find applications...
research
∙
12/31/2021
A Markov Decision Process Framework for Efficient and Implementable Contact Tracing and Isolation
Efficient contact tracing and isolation is an effective strategy to cont...
research
∙
06/14/2021
Planning to Fairly Allocate: Probabilistic Fairness in the Restless Bandit Setting
Restless and collapsing bandits are commonly used to model constrained r...
research
∙
06/14/2021
Fair Clustering Under a Bounded Cost
Clustering is a fundamental unsupervised learning problem where a datase...
research
∙
06/13/2021
Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes
Matching is one of the most fundamental and broadly applicable problems ...
research
∙
06/09/2021
Fair Disaster Containment via Graph-Cut Problems
Graph cut problems form a fundamental problem type in combinatorial opti...
research
∙
06/09/2021
A New Notion of Individually Fair Clustering: α-Equitable k-Center
Clustering is a fundamental problem in unsupervised machine learning, an...
research
∙
03/02/2021
Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints
Metric clustering is fundamental in areas ranging from Combinatorial Opt...
research
∙
10/14/2020
Improved Approximation Algorithms for Stochastic-Matching Problems
We consider the Stochastic Matching problem, which is motivated by appli...
research
∙
08/07/2020
Approximation Algorithms for Radius-Based, Two-Stage Stochastic Clustering Problems with Budget Constraints
The main focus of this paper is radius-based clustering problems in the ...
research
∙
07/14/2020
A Pairwise Fair and Community-preserving Approach to k-Center Clustering
Clustering is a foundational problem in machine learning with numerous a...
research
∙
12/18/2019
Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms During High-Demand Hours
Rideshare platforms, when assigning requests to drivers, tend to maximiz...
research
∙
11/30/2019
Mix and Match: Markov Chains Mixing Times for Matching in Rideshare
Rideshare platforms such as Uber and Lyft dynamically dispatch drivers t...
research
∙
07/09/2019
Vertex-weighted Online Stochastic Matching with Patience Constraints
Online Bipartite Matching is a classic problem introduced by Karp, Vazir...
research
∙
11/13/2018
Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity
In bipartite matching problems, vertices on one side of a bipartite grap...
research
∙
09/07/2018
Approximation algorithms for stochastic clustering
We consider stochastic settings for clustering, and develop provably-goo...
research
∙
04/22/2018
Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts
Online matching problems have garnered significant attention in recent y...
research
∙
12/18/2017
Approximation algorithms for stochastic and risk-averse optimization
We present improved approximation algorithms in stochastic optimization....
research
∙
11/22/2017
Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources
Bipartite matching markets pair agents on one side of a market with agen...
research
∙
11/07/2017
