Solving combinatorial exchanges: optimality via a few partial bids

Authors:
Anshul Kothari;Tuomas Sandholm;Subhash Suri
Affiliations:
UCSB, Santa Barbara, CA;Carnegie Mellon University, Pittsburgh, PA;UCSB, Santa Barbara, CA
Venue:
Proceedings of the 4th ACM conference on Electronic commerce
Year:
2003

Citing 4
Cited 1

Computationally Manageable Combinational Auctions

Management Science
Algorithm for optimal winner determination in combinatorial auctions

Artificial Intelligence
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence

The complexity of mixed multi-unit combinatorial auctions: Tractability under structural and qualitative restrictions

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract