skip to main content
column

On-line bipartite matching made simple

Published: 01 March 2008 Publication History

Abstract

We examine the classic on-line bipartite matching problem studied by Karp, Vazirani, and Vazirani [8] and provide a simple proof of their result that the Ranking algorithm for this problem achieves a competitive ratio of 1 -- 1/e.

References

[1]
M. Agarwal and A. Puri. Base station scheduling of requests with fixed deadlines. In INFO-COM 2002: twenty-first annual joint conference of the IEEE Communications Societies, pages 487--496. IEEE, 2002.
[2]
Yossi Azar and Yoel Chaiutin. Optimal node routing. In Proceedings of STACS '06 (Lecture Notes in Computer Science 3884, pages 596--607. Springer, 2006.
[3]
Yossi Azar, Joseph (Seffi) Naor, and Raphael Rom. The competitiveness of on-line assignments. In SODA '92: Proceedings of the third annual ACM-SIAM symposium on discrete algorithms, pages 203--210, Philadelphia, PA, USA, 1992. Society for Industrial and Applied Mathematics.
[4]
Yossi Azar and Yossi Richter. Management of multi-queue switches in QoS networks. Algorithmica, 43(1--2):81--96, 2005.
[5]
Avrim Blum, Tuomas Sandholm, and Martin Zinkevich. Online algorithms for market clearing. J. ACM, 53(5):845--879, 2006.
[6]
Niv Buchbinder, Kamal Jain, and Joseph (Seffi) Naor. Online primal-dual algorithms for maximizing ad-auctions revenue. In Proceedings of ESA '07 (Lecture Notes in Computer Science 4698), pages 253--264. Springer, 2007.
[7]
Gagan Goel and Aranyak Mehta. Online budgeted matching in random input models with applications to adwords. In SODA '08: Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, pages 982--991, Philadelphia, PA, USA, 2008. Society for Industrial and Applied Mathematics.
[8]
R. M. Karp, U. V. Vazirani, and V. V. Vazirani. An optimal algorithm for on-line bipartite matching. In STOC '90: Proceedings of the twenty-second annual ACM symposium on Theory of computing, pages 352--358, New York, NY, USA, 1990. ACM Press.
[9]
Benny Lehmann, Daniel Lehmann, and Noam Nisan. Combinatorial auctions with decreasing marginal utilities. In EC '01: Proceedings of the 3rd ACM conference on electronic commerce, pages 18--28, New York, NY, USA, 2001. ACM.
[10]
Mohammad Mahdian, Hamid Nazerzadeh, and Amin Saberi. Allocating online advertisement space with unreliable estimates. In EC '07: Proceedings of the 8th ACM conference on electronic commerce, pages 288--294, New York, NY, USA, 2007. ACM.
[11]
Aranyak Mehta, Amin Saberi, Umesh Vazirani, and Vijay Vazirani. Adwords and generalized online matching. J. ACM, 54(5):22, 2007.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGACT News
ACM SIGACT News  Volume 39, Issue 1
March 2008
84 pages
ISSN:0163-5700
DOI:10.1145/1360443
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 2008
Published in SIGACT Volume 39, Issue 1

Check for updates

Qualifiers

  • Column

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)53
  • Downloads (Last 6 weeks)1
Reflects downloads up to 17 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2025)Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable ResourcesOperations Research10.1287/opre.2021.0695Online publication date: 21-Jan-2025
  • (2025)Adwords with Unknown Budgets and BeyondManagement Science10.1287/mnsc.2021.0324371:2(1009-1026)Online publication date: Feb-2025
  • (2025)Optimal Algorithms for Online b-Matching with Variable Vertex CapacitiesAlgorithmica10.1007/s00453-024-01282-987:2(167-190)Online publication date: 1-Feb-2025
  • (2025)Online b-Matching with Stochastic RewardsSOFSEM 2025: Theory and Practice of Computer Science10.1007/978-3-031-82670-2_4(37-50)Online publication date: 7-Feb-2025
  • (2024)Online bipartite matching with imperfect adviceProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692420(8762-8781)Online publication date: 21-Jul-2024
  • (2024)Online Job Scheduling with K ServersIEICE Transactions on Information and Systems10.1587/transinf.2023FCP0005E107.D:3(286-293)Online publication date: 1-Mar-2024
  • (2024)Online Bipartite Matching with Reusable ResourcesMathematics of Operations Research10.1287/moor.2022.024249:3(1825-1854)Online publication date: 1-Aug-2024
  • (2024)Edge Manipulations for the Maximum Vertex-Weighted Bipartite b-matchingACM Transactions on Intelligent Systems and Technology10.1145/370265016:1(1-26)Online publication date: 6-Nov-2024
  • (2024)Improved Bounds for Fractional Online Matching ProblemsProceedings of the 25th ACM Conference on Economics and Computation10.1145/3670865.3673459(279-307)Online publication date: 8-Jul-2024
  • (2024)Online Primal Dual Meets Online Matching with Stochastic Rewards: Configuration LP to the RescueSIAM Journal on Computing10.1137/21M145470553:5(1217-1256)Online publication date: 4-Sep-2024
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media