Near optimal algorithms for online weighted bipartite matching in adversary model

DOI10.1007/s10878-016-0100-2zbMath1376.05125OpenAlexW2557538770MaRDI QIDQ1680479

Peng Zhang

Publication date: 16 November 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0100-2

zbMATH Keywords

weighted bipartite graphonline matchingadversary modelnear optimal algorithm

Mathematics Subject Classification ID

Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Mathematical economics (91B99)

Related Items (1)

Learn from history for online bipartite matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
• Online Stochastic Matching: Online Actions Based on Offline Statistics
• Online Stochastic Weighted Matching: Improved Approximation Algorithms
• Competitive Weighted Matching in Transversal Matroids
• Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
• AdWords and generalized online matching
• 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

This page was built for publication: Near optimal algorithms for online weighted bipartite matching in adversary model