Zhiyi Huang
Abstract
We introduce a fully online model of maximum cardinality matching in which all vertices arrive online. On the arrival of a vertex, its incident edges to previously arrived vertices are revealed. Each vertex has a deadline that is after all its neighbors’ arrivals. If a vertex remains unmatched until its deadline, then the algorithm must irrevocably either match it to an unmatched neighbor or leave it unmatched. The model generalizes the existing one-sided online model and is motivated by applications including ride-sharing platforms, real-estate agency, and so on.
We show that the Ranking algorithm by Karp et al. (STOC 1990) is 0.5211-competitive in our fully online model for general graphs. Our analysis brings a novel charging mechanic into the randomized primal dual technique by Devanur et al. (SODA 2013), allowing a vertex other than the two endpoints of a matched edge to share the gain. To our knowledge, this is the first analysis of Ranking that beats 0.5 on general graphs in an online matching problem, a first step toward solving the open problem by Karp et al. (STOC 1990) about the optimality of Ranking on general graphs. If the graph is bipartite, then we show a tight competitive ratio ≈0.5671 of Ranking. Finally, we prove that the fully online model is strictly harder than the previous model as no online algorithm can be 0.6317 < 1- 1/e-competitive in our model, even for bipartite graphs.
- Melika Abolhassani, T.-H. Hubert Chan, Fei Chen, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Hamid Mahini, and Xiaowei Wu. 2016. Beating ratio 0.5 for weighted oblivious matching problems. In Proceedings of the European Symposium on Algorithms (ESA’16) (LIPIcs), Vol. 57. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 3:1--3:18.Google Scholar
- Gagan Aggarwal, Gagan Goel, Chinmay Karande, and Aranyak Mehta. 2011. Online vertex-weighted bipartite matching and single-bid budgeted allocations. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’11). 1253--1264.Google ScholarCross Ref
- Jonathan Aronson, Martin Dyer, Alan Frieze, and Stephen Suen. 1995. Randomized greedy matching. II. Random Struct. Algorithms 6, 1 (Jan. 1995), 55--73. DOI:https://doi.org/10.1002/rsa.3240060107Google Scholar
- Itai Ashlagi, Maximilien Burq, Chinmoy Dutta, Patrick Jaillet, Amin Saberi, and Chris Sholley. 2019. Edge weighted online windowed matching. In Proceedings of the ACM Conference on Economics and Computation (EC’19). ACM, 729--742.Google ScholarDigital Library
- Benjamin Birnbaum and Claire Mathieu. 2008. On-line bipartite matching made simple. ACM SIGACT News 39, 1 (2008), 80--87.Google ScholarDigital Library
- Niv Buchbinder, Kamal Jain, and Joseph Naor. 2007. Online primal-dual algorithms for maximizing ad-auctions revenue. In Proceedings of the European Symposium on Algorithms (ESA’07) (Lecture Notes in Computer Science), Vol. 4698. Springer, 253--264.Google ScholarCross Ref
- Niv Buchbinder, Danny Segev, and Yevgeny Tkach. 2017. Online algorithms for maximum cardinality matching with edge arrivals. In Proceedings of the European Symposium on Algorithms (ESA’17) (LIPIcs), Vol. 87. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 22:1--22:14.Google Scholar
- T.-H. Hubert Chan, Fei Chen, Xiaowei Wu, and Zhichao Zhao. 2014. Ranking on arbitrary graphs: rematch via continuous LP with monotone and boundary condition constraints. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’14). 1112--1122.Google ScholarCross Ref
- Ashish Chiplunkar, Sumedh Tirodkar, and Sundar Vishwanathan. 2015. On randomized algorithms for matching in the online preemptive model. In Proceedings of the European Symposium on Algorithms (ESA’15) (Lecture Notes in Computer Science), Vol. 9294. Springer, 325--336.Google ScholarCross Ref
- Nikhil R. Devanur and Kamal Jain. 2012. Online matching with concave returns. In Proceedings of the Annual ACM Symposium on Theory of Computing (STOC’12). ACM, 137--144.Google Scholar
- Nikhil R. Devanur, Kamal Jain, and Robert D. Kleinberg. 2013. Randomized primal-dual analysis of RANKING for online bipartite matching. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’13). SIAM, 101--107.Google ScholarDigital Library
- Leah Epstein, Asaf Levin, Danny Segev, and Oren Weimann. 2013. Improved bounds for online preemptive matching. In Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS’13) (LIPIcs), Vol. 20. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 389--399.Google Scholar
- Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, and David Wajc. 2019. Online matching with general arrivals. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS’19). IEEE Computer Society, 26--37.Google ScholarCross Ref
- Gagan Goel and Aranyak Mehta. 2008. Online budgeted matching in random input models with applications to adwords. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’08). 982--991.Google Scholar
- Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, and Yuhao Zhang. 2018. Online vertex-weighted bipartite matching: Beating 1-1/e with random arrivals. In Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP’18) (LIPIcs), Vol. 107. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 79:1--79:14.Google Scholar
- Chinmay Karande, Aranyak Mehta, and Pushkar Tripathi. 2011. Online bipartite matching with unknown distributions. In Proceedings of the Annual ACM Symposium on Theory of Computing (STOC’11). 587--596.Google ScholarDigital Library
- Richard M. Karp, Umesh V. Vazirani, and Vijay V. Vazirani. 1990. An optimal algorithm for on-line bipartite matching. In Proceedings of the Annual ACM Symposium on Theory of Computing (STOC’90). 352--358.Google Scholar
- Mohammad Mahdian and Qiqi Yan. 2011. Online bipartite matching with random arrivals: An approach based on strongly factor-revealing LPs. In Proceedings of the Annual ACM Symposium on Theory of Computing (STOC’11). 597--606.Google ScholarDigital Library
- Andrew McGregor. 2005. Finding graph matchings in data streams. In Proceedings of the International Conference on Approximation, Randomization, and Combinatorial Optimization (APPROX-RANDOM’05) (Lecture Notes in Computer Science), Vol. 3624. Springer, 170--181.Google ScholarDigital Library
- Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, and Vijay V. Vazirani. 2007. AdWords and generalized online matching. J. ACM 54, 5 (2007), 22.Google ScholarDigital Library
- Matthias Poloczek and Mario Szegedy. 2012. Randomized greedy algorithms for the maximum matching problem with new analysis. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS’12). 708--717.Google ScholarDigital Library
- Zhihao Gavin Tang, Xiaowei Wu, and Yuhao Zhang. 2019. Toward a better understanding of randomized greedy matching. CoRR abs/1907.05135.Google Scholar
- Ashwinkumar Badanidiyuru Varadaraja. 2011. Buyback problem—Approximate matroid intersection with cancellation costs. In Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP’11) (Lecture Notes in Computer Science), Vol. 6755. Springer, 379--390.Google ScholarCross Ref
- Yajun Wang and Sam Chiu-wai Wong. 2015. Two-sided online bipartite matching and vertex cover: Beating the greedy algorithm. In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP’15). 1070--1081. DOI:https://doi.org/10.1007/978-3-662-47672-7_87Google ScholarCross Ref
Index Terms
- Fully Online Matching
Recommendations
Periodic Reranking for Online Matching of Reusable Resources
EC '22: Proceedings of the 23rd ACM Conference on Economics and ComputationWe consider a generalization of the vertex weighted online bipartite matching problem where the offline vertices, called resources, are reusable. In particular, when a resource is matched it is unavailable for a deterministic time duration d after which ...
Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark
EC '22: Proceedings of the 23rd ACM Conference on Economics and ComputationIn this paper, we study max-weight stochastic matchings on online bipartite graphs under both vertex and edge arrivals. We focus on designing polynomial time approximation algorithms with respect to the online benchmark, which was first considered by ...
Near optimal algorithms for online weighted bipartite matching in adversary model
Bipartite matching is an important problem in graph theory. With the prosperity of electronic commerce, such as online auction and AdWords allocation, bipartite matching problem has been extensively studied under online circumstances. In this work, we ...
Comments