An algorithm for optimal winner determination in combinatorial auctions
@inproceedings{Sandholm1999AnAF, title={An algorithm for optimal winner determination in combinatorial auctions}, author={T. Sandholm}, booktitle={IJCAI 1999}, year={1999} }
Combinatorial auctions, i.e. auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auctions in multi-item auctions where the agents' valuations of the items are not additive. However, determining the winners so as to maximize revenue is NP complete. We present a search algorithm for optimal winner determination. Experiments are shown on several bid distributions. The algorithm allows combinatorial auctions to scale up to… CONTINUE READING
Topics from this paper
327 Citations
Approaches to winner determination in combinatorial auctions
- Computer Science
- Decis. Support Syst.
- 2000
- 169
- PDF
An improved search technique for optimal winner determination in combinatorial auctions
- Computer Science
- 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the
- 2004
- 3
- PDF
An Improved Search Technique for Optimal Winner Determination in Combinatorial Auctions
- Computer Science
- HICSS
- 2004
- 3
- Highly Influenced
Reducing complexity in winner determination for combinatorial ascending auctions
- Computer Science
- Electron. Commer. Res. Appl.
- 2003
- 10
Exploring local search in winner determination problem
- Economics, Computer Science
- Inf. Technol. Manag.
- 2008
The computational complexity of dynamic programming algorithm for combinatorial auctions
- Computer Science
- Proceedings. International Conference on Machine Learning and Cybernetics
- 2002
- 3
Integer programming for combinatorial auction winner determination
- Computer Science
- Proceedings Fourth International Conference on MultiAgent Systems
- 2000
- 302
- Highly Influenced
- PDF
An efficient approximate allocation algorithm for combinatorial auctions
- Mathematics, Computer Science
- EC '01
- 2001
- 162
- PDF
BOB: Improved winner determination in combinatorial auctions and generalizations
- Computer Science
- Artif. Intell.
- 2003
- 161
- PDF
References
SHOWING 1-10 OF 10 REFERENCES
Greedy local improvement and weighted set packing approximation
- Mathematics, Computer Science
- SODA '99
- 1999
- 147
- PDF
An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations
- Computer Science
- AAAI
- 1993
- 599
- PDF
Depth-First Iterative-Deepening: An Optimal Admissible Tree Search
- Mathematics, Computer Science
- Artif. Intell.
- 1985
- 1,612
- PDF
Efficient bounds for the stable set, vertex cover and set packing problems
- Mathematics, Computer Science
- Discret. Appl. Math.
- 1983
- 284
- PDF
Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring
- Mathematics, Computer Science
- J. Graph Algorithms Appl.
- 1997
- 55
- PDF