The average-value allocation problem
From MaRDI portal
Cites work
- ``Who is next in line? On the significance of knowing the arrival order in Bayesian online settings
- A threshold of ln n for approximating set cover
- AdWords and generalized online matching
- AdWords in a panorama
- Autobidding with constraints
- Balanced Allocations
- Fast algorithms for online stochastic convex programming
- How the experts algorithm can help solve LPs online
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Maximizing a monotone submodular function subject to a matroid constraint
- On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP
- Online algorithms for covering and packing problems with convex objectives
- Online matching with concave returns
- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
- Online stochastic packing applied to display ad allocation
- Primal beats dual on online packing LPs in the random-order model
- Secretary Problems via Linear Programming
- The average-value allocation problem
- Tight approximation algorithms for maximum separable assignment problems
- Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem
This page was built for publication: The average-value allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6920833)
