A constant-factor approximation algorithm and universally truthful randomized mechanism for position auctions with heterogeneous ad sizes and capacity constraints.
Budgeted matching and budgeted matroid intersection via the gasoline puzzle.Mathematical Programming, 128:355–372
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Position Auctions with a Capacity Constraint
A constant-factor approximation algorithm and universally truthful randomized mechanism for position auctions with heterogeneous ad sizes and capacity constraints.