Beating Greedy For Approximating Reserve Prices in Multi-Unit VCG Auctions

Mahsa Derakhshan
Mahsa Derakhshan
David M. Pennock
David M. Pennock

symposium on discrete algorithms, 2020.

Cited by: 0|Bibtex|Views8
Other Links: arxiv.org|academic.microsoft.com

Abstract:

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

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments