• DOI:10.1016/S0004-3702(01)00159-X
Corpus ID: 17206962

Algorithm for optimal winner determination in combinatorial auctions

@article{Sandholm2002AlgorithmFO,
  title={Algorithm for optimal winner determination in combinatorial auctions},
  author={T. Sandholm},
  journal={Artif. Intell.},
  year={2002},
  volume={135},
  pages={1-54}
}

T. Sandholm

Published 2002

Computer Science

Artif. Intell.

Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms 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, we analyze existing approaches for tackling this problem: exhaustive enumeration, dynamic programming, and restricting the allowable combinations. Second, we study… CONTINUE READING

View via Publisher

wireless.fcc.gov

Save to Library

Create Alert

Cite

Launch Research Feed