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.
No takes yet. Share an insight, caveat, or question.
Cesa‐Bianchi et al. (2013) studied this question.