Abstract:We study the classical online bipartite matching problem: One side of the graph is known and vertices of the other side arrive online. It is well known that when the graph is edge-weighted, and vertices arrive in an adversarial order, no online algorithm has a nontrivial competitiveratio. To bypass this hurdle we modify the rules such that the adversary still picks the graph but has to reveal a random part (say half) of it to the player. The remaining part is given to the player in an adversarial order. This m… Show more
“…Another related stream of research is the online algorithms with samples [Azar et al, 2014, Correa et al, 2019, Kaplan et al, 2021, Zhang et al, 2022. Zhang et al [2022] is the most related one.…”
“…Another related stream of research is the online algorithms with samples [Azar et al, 2014, Correa et al, 2019, Kaplan et al, 2021, Zhang et al, 2022. Zhang et al [2022] is the most related one.…”
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.