Online Bipartite Matching with Reusable Resources: Periodic Reranking with Is -Competitive for Vertex-Weighted Reusable MatchingResearch Paper
Many allocation platforms match each arriving request to a compatible resource that is used for a while and then returns: virtual machines in cloud computing, listings on rental marketplaces, hospital beds and ventilators. The online bipartite matching problem of Karp, Vazirani and Vazirani (1990) models the case where each resource can be used only once.…