Multi-unit auctions with unknown supply
Multi-unit auctions with unknown supply
复制标题
供应量未知的多单位拍卖
DOI：
--
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
A. Saberi
中科院分区：
文献类型：
--
作者：
Mohammad Mahdian;A. Saberi
我们在供应在线到达的环境中研究了可腐烂商品的多单元拍卖。这是由于其在互联网上的广告拍卖中的应用而激发的。假设所有代理商真实地报告了他们的出价，我们给出了计算最佳单价拍卖的1 <> 4个竞争算法。我们使用该算法与最佳离线单价拍卖相比，开发具有恒定竞争比率的真实拍卖。
We study multi-unit auctions for perishable goods, in a setting where the supply arrives online. This is motivated by its application in advertisement auctions on the internet. We give a 1<over>4 -competitive algorithm for computing the optimal single price auction assuming that all the agents report their bids truthfully. We use that algorithm to develop a truthful auction with a constant competitive ratio compared to the optimum offline single-price auction.