Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
From MaRDI portal
Publication:4625673
DOI10.1145/3284177zbMath1427.91142arXiv1903.03944OpenAlexW2909539666MaRDI QIDQ4625673
No author found.
Publication date: 25 February 2019
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.03944
Combinatorial optimization (90C27) Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Online algorithms; streaming algorithms (68W27)
Related Items
Call admission problems on grids with advice ⋮ Secretary Markets with Local Information ⋮ Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds ⋮ Online Assortment and Market Segmentation under Bertrand Competition with Set-Dependent Revenues ⋮ Asymptotic analysis for multi-objective sequential stochastic assignment problems ⋮ Bicriteria Online Matching: Maximizing Weight and Cardinality ⋮ Dynamic Relaxations for Online Bipartite Matching ⋮ Online max-min fair allocation ⋮ Online allocation and display ads optimization with surplus supply ⋮ Know when to persist: deriving value from a stream buffer ⋮ Optimal dynamic multi-keyword bidding policy of an advertiser in search-based advertising ⋮ Per-Round Knapsack-Constrained Linear Submodular Bandits ⋮ Online stochastic matching: new algorithms and bounds ⋮ Secretary markets with local information ⋮ Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts ⋮ Online submodular maximization: beating 1/2 made simple ⋮ Autobidding with constraints ⋮ Online Submodular Maximization Problem with Vector Packing Constraint. ⋮ Unnamed Item
