Beating Greedy For Approximating Reserve Prices in Multi-Unit VCG Auctions
symposium on discrete algorithms, 2020.
We study the problem of finding personalized reserve prices for unit-demand buyers in multi-unit eager VCG auctions with correlated buyers. The input to this problem is a dataset of submitted bids of $n$ buyers in a set of auctions. The goal is to find a vector of reserve prices, one for each buyer, that maximizes the total revenue acro...More
PPT (Upload PPT)