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

Simple item page
dc.creatorGonen, Rica
dc.creatorLehmann, Daniel
dc.date2002-02-20
dc.date.accessioned2026-07-26T00:00:28Z
dc.descriptionFinding 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.
dc.descriptionPresented at EC'00
dc.identifierhttps://arxiv.org/abs/cs/0202032
dc.identifierhttp://arxiv.org/abs/cs/0202032
dc.identifierSecond ACM Conference on Electronic Commerce (EC'00) Minneapolis, Minnesota, October 2000, pp. 13-20
dc.identifier.urihttps://dspace.dare.co.zw/handle/123456789/103313
dc.subjectComputer Science and Game Theory
dc.subjectArtificial Intelligence
dc.subjectG.1.6;I.2.8
dc.titleOptimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics
dc.typetext

Files

Collections

Artificial intelligence