34 citations · 78 across the 11 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020★ 22 cited
Group-level Fairness Maximization in Online Bipartite Matching
Will Ma, Pan Xu, Yifan Xu
We consider the allocation of limited resources to heterogeneous customers who arrive in an online fashion. We would like to allocate the resources "fairly", so that no group of cu…
cs.DS2020
Improved Approximation Algorithms for Stochastic-Matching Problems
Marek Adamczyk, Brian Brubach, Fabrizio Grandoni +3
We consider the Stochastic Matching problem, which is motivated by applications in kidney exchange and online dating. In this problem, we are given an undirected graph. Each edge i…