competitive analysis 1graph algorithms 1online algorithms 1preemptive matching 1randomized algorithms 1
From the 1 of 2 linked papers with an AI index.
2 papers
cs.DS2026
Online Preemptive Matching Revisited
Peter Kiss, Mohammad Sharifi
The paper establishes a new upper bound of 0.5661 on the competitive ratio for online preemptive matching, improving on the previous best bound and showing hardness even when optim…
cs.GT2024
Fairness and Efficiency in Online Class Matching
MohammadTaghi Hajiaghayi, Shayan Chashm Jahan, Mohammad Sharifi +2
The online bipartite matching problem, extensively studied in the literature, deals with the allocation of online arriving vertices (items) to a predetermined set of offline vertic…