Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue
From MaRDI portal
Publication:6602240
DOI10.1137/21m1454705zbMath1548.68338MaRDI QIDQ6602240
Publication date: 11 September 2024
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Linear programming (90C05) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- An optimal deterministic algorithm for online \(b\)-matching
- A comparison theorem on moment inequalities between negatively associated and independent random variables
- Bayesian Mechanism Design
- Online Stochastic Matching: Online Actions Based on Offline Statistics
- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
- Improved Bounds for Online Stochastic Matching
- Online Vertex-Weighted Bipartite Matching
- Online Stochastic Matching: Beating 1-1/e
- How to match when all vertices arrive online
- Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model
- Online Stochastic Matching: New Algorithms with Better Bounds
- Online Stochastic Matching with Unequal Probabilities
- Online matching with concave returns
- Online bipartite matching with unknown distributions
- Online bipartite matching with random arrivals
- Randomized Primal-Dual Analysis of RANKING for Online Bipartite Matching
- Optimal Algorithms for Online b-Matching with Variable Vertex Capacities
- Online stochastic matching, poisson arrivals, and the natural linear program
- Edge-weighted online bipartite matching
- On the perturbation function of ranking and balance for weighted online bipartite matching
This page was built for publication: Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue
