Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model

DOI10.1007/978-3-030-94676-0_12OpenAlexW4205598973MaRDI QIDQ2152115FDOQ2152115

David P. Williamson, Billy Jin

Publication date: 6 July 2022

Full work available at URL: https://arxiv.org/abs/2007.12823

zbMATH Keywords

online algorithmsbipartite matching

Mathematics Subject Classification ID

Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26) Internet topics (68M11)

Cites Work

• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Online stochastic matching: online actions based on offline statistics
• Title not available (Why is that?)
• Improved Bounds for Online Stochastic Matching
• Online Stochastic Matching: Beating 1-1/e
• Online Stochastic Matching: New Algorithms with Better Bounds
• Online bipartite matching with unknown distributions
• Online bipartite matching with random arrivals
• Online matching and ad allocation
• Title not available (Why is that?)
• Randomized Primal-Dual Analysis of RANKING for Online Bipartite Matching
• Title not available (Why is that?)
• Online Vertex-Weighted Bipartite Matching

Cited In (3)

• Improved competitive ratio for edge-weighted online stochastic matching
• Online matching with stochastic rewards: advanced analyses using configuration linear programs
• Edge-weighted online bipartite matching

This page was built for publication: Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2152115)