We show a regret minimization algorithm for setting the reserve price in a sequence of second-price auctions, under the assumption that all bids are independently drawn from the same unknown and arbitrary distribution. Our algorithm is computationally efficient, and achieves a regret of (O) over tilde(root T) in a sequence of T auctions. This holds even when the number of bidders is stochastic with a known distribution.
Regret minimization for reserve prices in second-price auctions / N. Cesa-Bianchi, C. Gentile, Y. Mansour. - In: IEEE TRANSACTIONS ON INFORMATION THEORY. - ISSN 0018-9448. - 61:1(2015 Jan), pp. 549-564.
Regret minimization for reserve prices in second-price auctions
N. Cesa-BianchiPrimo
;
2015
Abstract
We show a regret minimization algorithm for setting the reserve price in a sequence of second-price auctions, under the assumption that all bids are independently drawn from the same unknown and arbitrary distribution. Our algorithm is computationally efficient, and achieves a regret of (O) over tilde(root T) in a sequence of T auctions. This holds even when the number of bidders is stochastic with a known distribution.| File | Dimensione | Formato | |
|---|---|---|---|
|
06939698.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
442.77 kB
Formato
Adobe PDF
|
442.77 kB | Adobe PDF | [it] Default value: Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I metadati presenti in AIR sono rilasciati con licenza CCO mentre i file delle pubblicazioni sono rilasciati con licenza CC BY-SA, salvo diversa indicazione. In caso di violazione di copyright, contattare l'assistenza di AIR




