research
∙
05/13/2020
Fully Online Matching II: Beating Ranking and Water-filling
Karp, Vazirani, and Vazirani (STOC 1990) initiated the study of online b...
share
research
∙
05/22/2019
Strategyproof and Approximately Maxmin Fair Share Allocation of Chores
We initiate the work on fair and strategyproof allocation of indivisible...
research
∙
10/18/2018
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model
Huang et al. (STOC 2018) introduced the fully online matching problem, a...
research
∙
06/06/2018
