Develops polynomial-time algorithms achieving competitive ratios of ~1/14.85 (general) and 1/6.86 (unit costs) for submodular welfare maximization with budgets under random-order item arrival.
Primal beats dual on online packing lps in the random-order model.SIAM Journal on Computing, 47(5):1939–1964, 2018
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Submodular Welfare Maximization with Budget Constraints in the Random-Order Model
Develops polynomial-time algorithms achieving competitive ratios of ~1/14.85 (general) and 1/6.86 (unit costs) for submodular welfare maximization with budgets under random-order item arrival.