Faster O(n²(k + log n)) algorithm for ad-types assignment without gap rules, inapproximability within k^{1-ε} with gap rules, and O(k n^{2k+1}) DP for exact solution with discounts.
Counterspeculation, auctions, and competitive s ealed tenders
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Ad Types Problem
Faster O(n²(k + log n)) algorithm for ad-types assignment without gap rules, inapproximability within k^{1-ε} with gap rules, and O(k n^{2k+1}) DP for exact solution with discounts.