English

Optimal Competitive Ratio of Two-sided Online Bipartite Matching

Data Structures and Algorithms 2026-02-23 v1 Computer Science and Game Theory
Authors: Zhihao Gavin Tang
View on arXiv ↗ PDF ↗

Abstract

We establish an optimal upper bound (negative result) of ∼0.526\sim 0.526 on the competitive ratio of the fractional version of online bipartite matching with two-sided vertex arrivals, matching the lower bound (positive result) achieved by Wang and Wong (ICALP 2015), and Tang and Zhang (EC 2024).

Keywords

online bipartite matching competitive ratio fractional matching two-sided arrivals upper bound

Cite

@article{arxiv.2602.18049,
  title  = {Optimal Competitive Ratio of Two-sided Online Bipartite Matching},
  author = {Zhihao Gavin Tang},
  journal= {arXiv preprint arXiv:2602.18049},
  year   = {2026}
}

Related papers

View all related →
Data Structures and Algorithms · Computer Science
Improved Bounds for Fractional Online Matching Problems
Zhihao Gavin Tang, Yuhao Zhang
2022-02-09
Data Structures and Algorithms · Computer Science
A New Impossibility Result for Online Bipartite Matching Problems
Flavio Chierichetti, Mirko Giacchini, Alessandro Panconesi, Andrea Vattani
2025-04-29
Data Structures and Algorithms · Computer Science
Optimal Online Bipartite Matching in Degree-2 Graphs
Amey Bhangale, Arghya Chakraborty, Prahladh Harsha
2025-11-21
Machine Learning · Computer Science
Online bipartite matching with imperfect advice
Davin Choo, Themis Gouleakis, Chun Kai Ling, Arnab Bhattacharyya
2024-05-24
Data Structures and Algorithms · Computer Science
Improved Competitive Ratios for Online Bipartite Matching on Degree Bounded Graphs
Yilong Feng, Xiaowei Wu, Shengwei Zhou
2023-12-05
Data Structures and Algorithms · Computer Science
Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities
Susanne Albers, Sebastian Schubert
2022-07-01
Data Structures and Algorithms · Computer Science
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals
Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
2019-09-13
Data Structures and Algorithms · Computer Science
A lower bound for online rectangle packing
Leah Epstein
2018-11-26
Data Structures and Algorithms · Computer Science
Competitive Algorithms for Online Weighted Bipartite Matching and its Variants
Nguyen Kim Thang
2021-11-03
Data Structures and Algorithms · Computer Science
Multiway Online Correlated Selection
Guy Blanc, Moses Charikar
2021-09-22
Data Structures and Algorithms · Computer Science
Understanding Zadimoghaddam's Edge-weighted Online Matching Algorithm: Weighted Case
Zhiyi Huang
2019-10-09
Data Structures and Algorithms · Computer Science
Improved Competitive Ratio for Edge-Weighted Online Stochastic Matching
Yilong Feng, Guoliang Qiu, Xiaowei Wu, Shengwei Zhou
2023-12-01
Data Structures and Algorithms · Computer Science
Improved Analysis of RANKING for Online Vertex-Weighted Bipartite Matching in the Random Order Model
Billy Jin, David P. Williamson
2022-11-09
Data Structures and Algorithms · Computer Science
A new lower bound for classic online bin packing
János Balogh, József Békési, György Dósa, Leah Epstein +1
2018-07-17
Data Structures and Algorithms · Computer Science
A Stronger Impossibility for Fully Online Matching
Alexander Eckl, Anja Kirschbaum, Marilena Leichter, Kevin Schewior
2021-09-07
Data Structures and Algorithms · Computer Science
Optimal Rounding for Two-Stage Bipartite Matching
Tristan Pollner, Amin Saberi, Anders Wikum
2025-10-24
Data Structures and Algorithms · Computer Science
Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path Based Formulation
Vineet Goyal, Rajan Udwani
2022-05-12
Data Structures and Algorithms · Computer Science
Lower bounds for several online variants of bin packing
János Balogh, József Békési, György Dósa, Leah Epstein +1
2017-08-11
Data Structures and Algorithms · Computer Science
Online Matching on $3$-Uniform Hypergraphs
Sander Borst, Danish Kashaev, Zhuan Khye Koh
2026-04-20
Data Structures and Algorithms · Computer Science
Edge-Weighted Online Bipartite Matching
Matthew Fahrbach, Zhiyi Huang, Runzhou Tao, Morteza Zadimoghaddam
2024-06-05
Data Structures and Algorithms · Computer Science
Online Bipartite Matching in the Probe-Commit Model
Allan Borodin, Calum MacRury
2024-12-16
Data Structures and Algorithms · Computer Science
Degree-bounded Online Bipartite Matching: OCS vs. Ranking
Yilong Feng, Haolong Li, Xiaowei Wu, Shengwei Zhou
2025-10-02
Data Structures and Algorithms · Computer Science
(Fractional) Online Stochastic Matching via Fine-Grained Offline Statistics
Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu
2022-04-15
Data Structures and Algorithms · Computer Science
Online Vertex Cover and Matching: Beating the Greedy Algorithm
Yajun Wang, Sam Chiu-wai Wong
2013-05-09
Data Structures and Algorithms · Computer Science
Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three
Kanstantsin Pashkovich, Thomas Snow
2026-02-10