Learn from history for online bipartite matching
From MaRDI portal
Publication:2091114
DOI10.1007/s10878-022-00916-4zbMath1505.90115OpenAlexW4297517344MaRDI QIDQ2091114
Kelin Luo, Hui-Li Zhang, Weitian Tong, Rui Du
Publication date: 31 October 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00916-4
competitive ratioonline bipartite matchingrandom-order modelhistorical informationadversary-order model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dynamic learning algorithm for online matching problems with concave returns
- A stochastic algorithm for online bipartite resource allocation problems
- Near optimal algorithms for online maximum edge-weighted \(b\)-matching and two-sided vertex-weighted \(b\)-matching
- An optimal deterministic algorithm for online \(b\)-matching
- Near optimal algorithms for online weighted bipartite matching in adversary model
- An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
- Bayesian Mechanism Design
- Online Stochastic Matching: Online Actions Based on Offline Statistics
- Online Stochastic Weighted Matching: Improved Approximation Algorithms
- Improved Bounds for Online Stochastic Matching
- Online Vertex-Weighted Bipartite Matching
- Competitive Analysis with a Sample and the Secretary Problem
- Online Stochastic Matching: Beating 1-1/e
- Online Stochastic Matching: New Algorithms with Better Bounds
- Algorithms for Secretary Problems on Graphs and Hypergraphs
- Online bipartite matching with unknown distributions
- Online bipartite matching with random arrivals
- Randomized Primal-Dual Analysis of RANKING for Online Bipartite Matching
- An Experimental Study of Algorithms for Online Bipartite Matching
This page was built for publication: Learn from history for online bipartite matching
