Regret Minimization for Reserve Prices in Second-Price Auctions
Lists
Only you see this
Abstract
We show a regret minimization algorithm for setting the reserve price in second-price auctions. We make the assumption that all bidders draw their bids from the same unknown and arbitrary distribution. Our algorithm is computationally efficient, and achieves a regret of , even when the number of bidders is stochastic with a known distribution.
BibTeX
@inproceedings{cesabianchi2013regret,
author = {Nicolò Cesa-Bianchi and Claudio Gentile and Yishay Mansour},
title = {{Regret Minimization for Reserve Prices in Second-Price Auctions}},
booktitle = {SODA},
year = {2013},
doi = {10.1137/1.9781611973105.86},
}Loading related content...