Approaches to winner determination in combinatorial auctions

  title={Approaches to winner determination in combinatorial auctions},
  author={T. Sandholm},
  journal={Decis. Support Syst.},
  • T. Sandholm
  • Published 2000
  • Computer Science
  • Decis. Support Syst.
  • Abstract 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. First, existing approaches for tackling this problem are reviewed: exhaustive enumeration, dynamic programming, approximation algorithms, and restricting the allowable… CONTINUE READING
    169 Citations
    A Heuristic for Winner Determination in Rule-Based Combinatorial Auctions
    • 15
    • PDF
    Surplus optimization in combinatorial double auctions
    • F. Hsieh, Chi-Shiang Liao
    • Economics, Mathematics
    • 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (ISSDM2012)
    • 2012
    • 2
    Winner Determination Algorithms for Electronic Auctions: A Framework Design
    • 27
    • PDF
    A Framework of Winner Determination Algorithms for Internet Auctions
    • 1
    • PDF
    On the sensitivity of incremental algorithms for combinatorial auctions
    • 27
    • PDF
    Caching in multi-unit combinatorial auctions
    • 6
    Preference elicitation in combinatorial auctions
    • 196
    • PDF
    Assessing the benefits of group-buying-based combinatorial reverse auctions
    • 33
    • PDF


    Algorithm for optimal winner determination in combinatorial auctions
    • 1,020
    • PDF
    An algorithm for optimal winner determination in combinatorial auctions
    • 325
    eMediator: A Next Generation Electronic Commerce Server
    • 151
    • PDF
    Coalition Structure Generation with Worst Case Guarantees
    • 732
    • PDF