AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
Combinatorial auctions for supply chain formation
Proceedings of the 2nd ACM conference on Electronic commerce
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
CABOB: a fast optimal algorithm for combinatorial auctions
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Weighted super solutions for constraint programs
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Hi-index | 0.00 |
Super solutions provide a framework for finding robust solutions to Constraint Satisfaction Problems [5,3]. We present a novel application of super solutions to combinatorial auctions in which a bid may be disqualified or withdrawn after the winners are announced. We examine the effectiveness of super solutions in different auction scenarios that simulate economically motivated bidding patterns. We also analyze the drawbacks of this approach and motivate an extension to the framework that permits a more flexible and realistic approach for determining robust solutions.