• DOI:10.1016/S0167-9236(99)00066-4
Corpus ID: 7404529

Approaches to winner determination in combinatorial auctions

@article{Sandholm2000ApproachesTW,
  title={Approaches to winner determination in combinatorial auctions},
  author={T. Sandholm},
  journal={Decis. Support Syst.},
  year={2000},
  volume={28},
  pages={165-176}
}

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

View via Publisher

wireless.fcc.gov

Save to Library

Create Alert

Cite

Launch Research Feed