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.
Lipton, Evangelos Markakis, and Aranyak Mehta
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Revenue maximization for pricing datasets to budget-constrained buyers is APX-hard, with a 2-approximation for online arrivals and a (1-1/e)^{-1}-approximation for offline.
citing papers explorer
No citing papers match the current filters.