• DOI:10.1016/S0004-3702(03)00015-8
Corpus ID: 9213072

BOB: Improved winner determination in combinatorial auctions and generalizations

@article{Sandholm2003BOBIW,
  title={BOB: Improved winner determination in combinatorial auctions and generalizations},
  author={T. Sandholm and S. Suri},
  journal={Artif. Intell.},
  year={2003},
  volume={145},
  pages={33-58}
}

T. Sandholm, S. Suri

Published 2003

Computer Science

Artif. Intell.

Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary or substitutable. 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… CONTINUE READING

View via Publisher

www-2.cs.cmu.edu

Save to Library

Create Alert

Cite

Launch Research Feed