Improved algorithms for optimal winner determination in combinatorial auctions and generalizations

DMCA

Improved algorithms for optimal winner determination in combinatorial auctions and generalizations (2000)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Tuomas Sandholm , Subhash Suri

Citations:

582 - 53 self

BibTeX

@MISC{Sandholm00improvedalgorithms,
    author = {Tuomas Sandholm and Subhash Suri},
    title = {Improved algorithms for optimal winner determination in combinatorial auctions and generalizations},
    year = {2000}
}

OpenURL

Abstract

Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper presents a more sophisticated search algorithm for optimal (and anytime) winner determination, including structural improvements that reduce search tree size, faster data structures, and optimizations at search nodes based on driving toward, identifying and solving tractable special cases. We also uncover a more general tractable special case, and design algorithms for solving it as well as for solving known tractable special cases substantially faster. We generalize combinatorial auctions to multiple units of each item, to reserve prices on singletons as well as combinations, and to combinatorial exchanges -- all allowing for substitutability. Finally, we present algorithms for determining the winners in these generalizations.

Keyphrases

combinatorial auction optimal winner determination tractable special case winner determination data structure structural improvement optimal search algorithm search tree size search node efficient resource task allocation combinatorial exchange sophisticated search algorithm multiagent system general tractable special case design algorithm

DMCA