An Ascending Vickrey Auction for Selling Bases of a Matroid
An Ascending Vickrey Auction for Selling Bases of a Matroid
复制标题
销售拟阵底座的升序维克瑞拍卖
DOI:
10.1287/opre.1100.0888
复制
发表时间:
2011
期刊:
影响因子:
--
通讯作者:
R. Vohra
中科院分区:
文献类型:
--
作者:
S. Bikhchandani;S. D. Vries;J. Schummer;R. Vohra
Consider selling bundles of indivisible goods to buyers with concave utilities that are additively separable in money and goods. We propose an ascending auction for the case when the seller is constrained to sell bundles whose elements form a basis of a matroid. It extends easily to polymatroids. Applications include scheduling, allocation of homogeneous goods, and spatially distributed markets, among others. Our ascending auction induces buyers to bid truthfully and returns the economically efficient basis. Unlike other ascending auctions for this environment, ours runs in pseudopolynomial or polynomial time. Furthermore, we prove the impossibility of an ascending auction for nonmatroidal independence set-systems.