Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics

Rica Gonen, Daniel Lehmann

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationEC 2000 - Proceedings of the 2nd ACM Conference on Electronic Commerce
PublisherAssociation for Computing Machinery, Inc
Pages13-20
Number of pages8
ISBN (Electronic)9781581132724
DOIs
StatePublished - 17 Oct 2000
Externally publishedYes
Event2nd ACM Conference on Electronic Commerce, EC 2000 - Minneapolis, United States
Duration: 17 Oct 200020 Oct 2000

Publication series

NameEC 2000 - Proceedings of the 2nd ACM Conference on Electronic Commerce

Conference

Conference2nd ACM Conference on Electronic Commerce, EC 2000
Country/TerritoryUnited States
CityMinneapolis
Period17/10/0020/10/00

Bibliographical note

Funding 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.

Publisher Copyright:
© 2000 ACM. All rights reserved.

Keywords

  • branch and bound
  • combinatorial auctions

Cite this