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

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

2002-02-20

arxiv.org/abs/cs/0202032v1

Second ACM Conference on Electronic Commerce (EC'00) Minneapolis, Minnesota, October 2000, pp. 13-20

Computer Science

Computer Science and Game Theory

Presented at EC'00

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-538625