Fractional Fully Online Matching
This paper studies fractional matching on general graphs in the fully online model of Huang et al. (JACM 2020), in which all vertices arrive online and remain available for only a limited time, and extends the classic Water-Filling algorithm to the fully online setting, establishing that Water-Filling is not optimal in the fully online setting.