76 search results - page 1 / 16 » CABOB: A Fast Optimal Algorithm for Combinatorial Auctions |
IJCAI
2001
13 years 6 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
WECWIS
2002
IEEE
13 years 9 months ago
2002
IEEE
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
ACMICEC
2003
ACM
13 years 10 months ago
2003
ACM
This paper presents new clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with piecewise linear demand/supply functions. We analyse the complexi...
AI
2002
Springer
13 years 4 months ago
2002
Springer
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
SIGECOM
2000
ACM
13 years 9 months ago
2000
ACM
General combinatorial auctions—auctions in which bidders place unrestricted bids for bundles of goods—are the subject of increasing study. Much of this work has focused on alg...