Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model
From MaRDI portal
Publication:2152115
DOI10.1007/978-3-030-94676-0_12OpenAlexW4205598973MaRDI QIDQ2152115FDOQ2152115
Authors: Billy Jin, David P. Williamson 
Publication date: 6 July 2022
Full work available at URL: https://arxiv.org/abs/2007.12823
Recommendations
- scientific article; zbMATH DE number 7376006
- Online vertex-weighted bipartite matching. Beating \(1-\frac{1}{e}\) with random arrivals
- Randomized primal-dual analysis of RANKING for online bipartite matching
- Online bipartite matching with random arrivals, an approach based on strongly factor-revealing LPs
- Tighter bounds for online bipartite matching
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)
- 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, an approach based on strongly factor-revealing LPs
- Online matching and ad allocation
- Online vertex-weighted bipartite matching and single-bid budgeted allocations
- Randomized primal-dual analysis of RANKING for online bipartite matching
- New algorithms, better bounds, and a novel model for online stochastic matching
- Online vertex-weighted bipartite matching. Beating \(1-\frac{1}{e}\) with random arrivals
Cited In (3)
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)
