An algorithm for optimal winner determination in combinatorial auctions

  title={An algorithm for optimal winner determination in combinatorial auctions},
  author={T. Sandholm},
  booktitle={IJCAI 1999},
  • T. Sandholm
  • Published in IJCAI 1999
  • Computer Science
  • 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
    327 Citations

    Topics from this paper

    Approaches to winner determination in combinatorial auctions
    • 169
    • PDF
    An improved search technique for optimal winner determination in combinatorial auctions
    • T. Sandholm
    • 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
    • 3
    • Highly Influenced
    Reducing complexity in winner determination for combinatorial ascending auctions
    • 10
    Exploring local search in winner determination problem
    The computational complexity of dynamic programming algorithm for combinatorial auctions
    • Shan-Li Hu, Chun-Yi Shi
    • Computer Science
    • Proceedings. International Conference on Machine Learning and Cybernetics
    • 2002
    • 3
    Integer programming for combinatorial auction winner determination
    • 302
    • Highly Influenced
    • PDF
    An efficient approximate allocation algorithm for combinatorial auctions
    • 162
    • PDF
    BOB: Improved winner determination in combinatorial auctions and generalizations
    • 161
    • PDF


    Greedy local improvement and weighted set packing approximation
    • 147
    • PDF
    Approximations of Independent Sets in Graphs
    • 58
    Depth-First Iterative-Deepening: An Optimal Admissible Tree Search
    • R. Korf
    • Mathematics, Computer Science
    • Artif. Intell.
    • 1985
    • 1,612
    • PDF
    Analyzing the Airwaves Auction
    • 530
    • PDF
    Efficient bounds for the stable set, vertex cover and set packing problems
    • D. Hochbaum
    • Mathematics, Computer Science
    • Discret. Appl. Math.
    • 1983
    • 284
    • PDF
    Clique is hard to approximate withinn1−ε
    • 1,059