Finding optimal solutions for multi-unit combinatorial auc- tions 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 e ciently 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.
|Title of host publication||EC 2000 - Proceedings of the 2nd ACM Conference on Electronic Commerce|
|Publisher||Association for Computing Machinery, Inc|
|Number of pages||8|
|State||Published - 17 Oct 2000|
|Event||2nd ACM Conference on Electronic Commerce, EC 2000 - Minneapolis, United States|
Duration: 17 Oct 2000 → 20 Oct 2000
|Name||EC 2000 - Proceedings of the 2nd ACM Conference on Electronic Commerce|
|Conference||2nd ACM Conference on Electronic Commerce, EC 2000|
|Period||17/10/00 → 20/10/00|
Bibliographical noteFunding Information:
Conversations with Michel Bercovier and Michael Ben-Or and remarks from Amir Ronen are gratefully acknowledged. The first author is partially supported by Grant 15561-1-99 from the Israel Ministry of Science, Culture and Sport and by the Jean and Helene Alfassa fund for research in Artificial Intelligence.
© 2000 ACM. All rights reserved.
- branch and bound
- combinatorial auctions