Regret Minimization for Reserve Prices in Second-Price Auctions

被引：0
|
作者：
Cesa-Bianchi, Nicolo [1 ]
Gentile, Claudio [2 ]
Mansour, Yishay [3 ]
机构：
[1] Univ Milan, Dept Comp Sci, Milan, Italy
[2] Univ Insubria, Dipartimento Sci Teor & Appl, Varese, VA, Italy
[3] Tel Aviv Univ, Sch Comp Sci, Tel Aviv, Israel
来源：
PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013) | 2013年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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 (O) over tilde(root T), even when the number of bidders is stochastic with a known distribution.
引用
收藏
页码：1190 / 1204
页数：15
相关论文
共 50 条
12345