CABOB: A fast optimal algorithm for combinatorial auctions

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 1102-1108

  Sandholm, Tuomas ^a   Suri, Subhash ^b   Gilpin, Andrew ^c   Levine, David ^c  

^a Carnegie Mellon University   (United States)

^b University of California   (United States)

^c CombineNet Inc ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL AUCTION; DECOMPOSITION TECHNIQUE; HEAVY-TAILS; OPTIMAL ALGORITHM; RANDOM RESTART; RUNTIME DISTRIBUTIONS; SEARCH ALGORITHMS; STRUCTURAL OBSERVATIONS;

ARTIFICIAL INTELLIGENCE; COMMERCE;

ALGORITHMS;

EID: 84880855418     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Arne Andersson, Mattias Tenhunen, and Fredrik Ygge. Integer programming for combinatorial auction winner determination. In ICMAS, pages 39-46.
2. Wolfram Conen and Tuomas Sandholm. Minimal preference elicitation in combinatorial auctions. In IJCAI-2001 Workshop on Economic Agents, Models, and Mechanisms.
3. Sven de Vries and Rakesh Vohra. Combinatorial auctions: A survey. August 28th.
4. Yuzo Fujishima, Kevin Leyton-Brown, and Yoav Shoham. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In IJCAI, pages 548-553.
5. Carla Gomes, Bart Selman, and Henry Kautz. Boosting combinatorial search through randomization. In AAAI.
6. Holger Hoos and Craig Boutilier. Solving combinatorial auctions using stochastic local search. In AAAI, pages 22-29.
7. Daniel Lehmann, Lidian Ita O'Callaghan, and Yoav Shoham. Truth revelation in rapid, approximately efficient combinatorial auctions. In ACM Conference on Electronic Commerce, pages 96-102.
8. Kevin Leyton-Brown, Mark Pearson, and Yoav Shoham. Towards a universal test suite for combinatorial auction algorithms. In ACM Conference on Electronic Commerce, pages 66-76.
9. Michael Luby, Alistair Sinclair, and David Zuckerman. Optimal speedup of Las Vegas algorithms. Information Processing Letters, 47:173-180.
10. Noam Nisan. Bidding and allocation in combinatorial auctions. In ACM Conference on Electronic Commerce, pages 1-12.
11. S J Rassenti, V L Smith, and R L Bulfin. A combinatorial auction mechanism for airport time slot allocation. Bell J. of Economics, 13:402-417.
12. Michael H Rothkopf, Aleksandar Pekeč, and Ronald M Harstad. Computationally manageable combinatorial auctions. Management Science, 44(8):1131-1147.
13. Tuomas Sandholm and Subhash Suri. Improved algorithms for optimal winner determination in combinatorial auctions and generalizations. In AAAI, pages 90-97.
14. Tuomas Sandholm and Subhash Suri. Side constraints and non-price attributes in combinatorial markets. In IJCAI-2001 Workshop on Distributed Constraint Reasoning.
15. Tuomas Sandholm, Subhash Suri, Andrew Gilpin, and David Levine. Winner determination in combinatorial auction generalizations. In AGENTS Workshop on Agent-Based Approaches to B2B.
16. Tuomas Sandholm. An implementation of the contract net protocol based on marginal cost calculations. In AAAI, p. 256-262.
17. Tuomas Sandholm. An algorithm for optimal winner determination in combinatorial auctions. In IJCAI, pages 542-547, 1999. First appeared as Washington Univ., Dept. of Computer Science, WUCS-99-01, Jan. 28th.
18. Tuomas Sandholm. eMediator: A next generation electronic commerce server. In AGENTS, pages 73-96, 2000.
19. Early version: AAAI-99Workshop on AI in Electronic Commerce, Orlando, FL, pp. 46-55, July 1999, and Washington University, St. Louis, Dept. of Computer Science WU-CS-99-02, Jan. 1999.
20. Laurence Wolsey. Integer Programming. John Wiley.