Online matching meets sampling without replacement

DOI10.1007/978-3-032-08560-3_5MaRDI QIDQ7285563zbMATH OpenFDO

Authors Zhiyi Huang, Chui Shan Lee, Jianqiao Lu

Publication date 19 June 2026

Full work available at URL https://doi.org/10.1007/978-3-032-08560-3_5

Mathematics Subject Classification ID

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

Cites work

• (Fractional) online stochastic matching via fine-grained offline statistics
• AdWords and generalized online matching
• AdWords in a panorama
• An Experimental Study of Algorithms for Online Bipartite Matching
• An optimal deterministic algorithm for online \(b\)-matching
• An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions
• Edge-weighted online bipartite matching
• Fast algorithms for online stochastic convex programming
• scientific article; zbMATH DE number 5764830 (Why is no real title available?)
• Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model
• Improved Bounds for Online Stochastic Matching
• Improved online correlated selection
• Lossless online rounding for online bipartite matching (despite its impossibility)
• Multiway online correlated selection
• New algorithms, better bounds, and a novel model for online stochastic matching
• Online bipartite matching with random arrivals, an approach based on strongly factor-revealing LPs
• Online bipartite matching with unknown distributions
• Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
• Online stochastic matching, poisson arrivals, and the natural linear program
• Online Stochastic Matching: Beating 1-1/e
• Online stochastic matching: new algorithms with better bounds
• Online stochastic matching: online actions based on offline statistics
• Online stochastic weighted matching: improved approximation algorithms
• Online vertex-weighted bipartite matching and single-bid budgeted allocations
• Online vertex-weighted bipartite matching. Beating \(1-\frac{1}{e}\) with random arrivals
• Primal beats dual on online packing LPs in the random-order model
• Randomized primal-dual analysis of RANKING for online bipartite matching
• The power of multiple choices in online stochastic matching

This page was built for publication: Online matching meets sampling without replacement

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