Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility)
Niv Buchbinder, Joseph (Seffi) Naor, David Wajc

TL;DR
This paper explores the possibility of lossless online rounding in bipartite matching, introducing constraints to overcome the general impossibility and achieving improved algorithms and thresholds.
Contribution
It characterizes non-convex constraints enabling lossless online rounding, leading to better competitive ratios and new insights into randomness requirements in online bipartite matching.
Findings
Lossless online rounding is generally impossible, but can be achieved under specific constraints.
Introduces non-convex constraints that enable lossless rounding and improved competitive ratios.
Provides thresholds for randomness needed to outperform deterministic algorithms.
Abstract
For numerous online bipartite matching problems, such as edge-weighted matching and matching under two-sided vertex arrivals, the state-of-the-art fractional algorithms outperform their randomized integral counterparts. This gap is surprising, given that the bipartite fractional matching polytope is integral, and so lossless rounding is possible. This gap was explained by Devanur et al.~(SODA'13), who showed that \emph{online} lossless rounding is impossible. Despite the above, we initiate the study of lossless online rounding for online bipartite matching problems. Our key observation is that while lossless online rounding is impossible \emph{in general}, randomized algorithms induce fractional algorithms of the same competitive ratio which by definition are losslessly roundable online. This motivates the addition of constraints that decrease the ``online integrality gap'', thus…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Optimization and Search Problems · Cryptography and Data Security
