Online matching with stochastic rewards: advanced analyses using configuration linear programs
From MaRDI portal
Cites work
- (Fractional) online stochastic matching via fine-grained offline statistics
- AdWords and generalized online matching
- An optimal deterministic algorithm for online \(b\)-matching
- Edge-weighted online bipartite matching
- scientific article; zbMATH DE number 5764830 (Why is no real title available?)
- scientific article; zbMATH DE number 7788622 (Why is no real title available?)
- Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model
- Online bipartite matching with random arrivals, an approach based on strongly factor-revealing LPs
- Online bipartite matching with unknown distributions
- Online matching with concave returns
- Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path-Based Formulation
- Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue
- 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 vertex-weighted bipartite matching and single-bid budgeted allocations
- Online vertex-weighted bipartite matching. Beating \(1-\frac{1}{e}\) with random arrivals
- 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 with stochastic rewards: advanced analyses using configuration linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6609158)