Sciweavers

AAAI
2000

An Algorithm for Multi-Unit Combinatorial Auctions

13 years 5 months ago
An Algorithm for Multi-Unit Combinatorial Auctions
We present a novel algorithm for computing the optimal winning bids in a combinatorial auction (CA), that is, an auction in which bidders bid for bundles of goods. All previously published algorithms are limited to single-unit CAs, already a hard computational problem. In contrast, here we address the more general problem in which each good may have multiple units, and each bid species an unrestricted number of units desired from each good. We prove the correctness of our branch-and-bound algorithm, which incorporates a specialized dynamic programming procedure. We then provide very encouraging initial experimental results from an implemented version of the algorithm.
Kevin Leyton-Brown, Yoav Shoham, Moshe Tennenholtz
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 2000
Where AAAI
Authors Kevin Leyton-Brown, Yoav Shoham, Moshe Tennenholtz
Comments (0)