Super Solutions for Combinatorial Auctions

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.

• Type: Conference
• Year: 2004
• Where: CSCLP
• Authors: Alan Holland, Barry O'Sullivan
• Keywords: Constraint Satisfaction Problems, CSCLP 2004, Robust Solutions, Super Solutions