Delong, Steven; Farhadi, Alireza; Niazadeh, Rad; Sivan, … - 2022
We study the classic online bipartite matching problem with a twist: offline vertices, called resources, are reusable. In particular, when a resource is matched to an online vertex it is unavailable for a deterministic time duration d after which it becomes available again for a re-match. Thus,...