4 papers
A Tight Bound on Online Vertex Cover under Edge Arrivals
Zhihao Gavin Tang, Yuhao Zhang
We prove a tight impossibility result for online vertex cover under edge arrivals. No randomized integral or fractional algorithm achieves a competitive ratio strictly below ag…
Fractional Fully Online Matching
Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu +1
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…
Prophet Secretary and Matching: the Significance of the Largest Item
Ziyun Chen, Zhiyi Huang, Dongchen Li +1
The prophet secretary problem is a combination of the prophet inequality and the secretary problem, where elements are drawn from known independent distributions and arrive in unif…
Incentives for Early Arrival in Cost Sharing
Junyu Zhang, Yao Zhang, Yaoxin Ge +4
In cooperative games, we study how values created or costs incurred by a coalition are shared among the members within it, and the players may join the coalition in a online manner…