Solving combinatorial exchanges: Optimality via a few partial bids

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2003, Pages 236-237

  Kothari, Anshul ^a   Sandholm, Tuomas ^b   Suri, Subhash ^a  

^a University of California   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Algorithms; Combinatorial auctions; Combinatorial exchanges

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; GAME THEORY; MARKETING; PROBLEM SOLVING; RESOURCE ALLOCATION;

COMBINATORIAL AUCTIONS; COMBINATORIAL EXCHANGES;

ELECTRONIC COMMERCE;

EID: 0242624667     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. K. Leyton-Brown, Y. Fujishima and Y. Shoham. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. IJCAI, 1999.
2. A. Pekec M. H. Rothkopf and R. M. Harstad. Computationally manageable combinatorial auctions. In Management Science, volume 44, pages 1131-1147, 1998.
3. T. Sandholm and S. Suri. Improved algorithms for optimal winner determination in combinatorial auctions and generalizations. Artificial Intelligence, To Appear.
4. T. Sandholm and S. Suri. Also in AAAI, 2000.
5. T. Sandholm. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence, 135:1-54, January 2002.
6. T. Sandholm. Also inIJCAI, 1999.