2002/02/20 by Rica Gonen, Daniel Lehmann
Computer Science · #cs.GT #cs.AI
published as Second ACM Conference on Electronic Commerce (EC'00) Minneapolis, Minnesota, October 2000, pp. 13-20 · Presented at EC'00
arxiv created 2002/02/20 · arxiv updated 2009/11/30
Finding optimal solutions for multi-unit combinatorial auctions is a hard problem and finding approximations to the optimal solution is also hard. We investigate the use of Branch-and-Bound techniques: they require both a way to bound from above the value of the best allocation and a good criterion to decide which bids are to be tried first. Different methods for efficiently bounding from above the value of the best allocation are considered. Theoretical original results characterize the best approximation ratio and the ordering criterion that provides it. We suggest to use this criterion.