| | |
| | |
Stat |
Members: 3643 Articles: 2'487'895 Articles rated: 2609
28 March 2024 |
|
| | | |
|
Article overview
| |
|
Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics | Rica Gonen
; Daniel Lehmann
; | Date: |
20 Feb 2002 | Journal: | Second ACM Conference on Electronic Commerce (EC’00) Minneapolis, Minnesota, October 2000, pp. 13-20 | Subject: | Computer Science and Game Theory; Artificial Intelligence ACM-class: G.1.6;I.2.8 | cs.GT cs.AI | Abstract: | 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. | Source: | arXiv, cs.GT/0202032 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |