Solving Combinatorial Auctions Using Stochastic Local Search

By Holger H. Hoos, Craig Boutilier. AAAI/IAAI, 2000

295 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/e7b401702f1f5867d38383431050b620f49ceb55

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Kevin Leyton-Brown
2. Frank Hutter
3. Yoav Shoham
4. Eugene Nudelman
5. Holger H. Hoos
6. Lin Xu
7. Jakob N. Foerster
8. Katharina Eggensperger

Citations in the corpus

• Combinatorial auctions (2007, unknown): “(1998), the search algorithms that have been proposed in the literature (e.g., Fujushima et al. 1999; Sandholm 2002; Sandholm et al. 2001; Hoos and Boutilier 2000) capitalize on the observation that when the number of items is large, bidders are likely to formulate bids on only a small subset of all”
• Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions (2002, methodology): “Along with the first wave of algorithms for the WDP, seven distr ibutions were proposed in [21, 6, 11] that have been widely used by other researchers including many of those cited above.”