Super Solutions for Combinatorial Auctions

  • Alan Holland
  • Barry O’Sullivan
Conference paper

DOI: 10.1007/11402763_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3419)
Cite this paper as:
Holland A., O’Sullivan B. (2005) Super Solutions for Combinatorial Auctions. In: Faltings B.V., Petcu A., Fages F., Rossi F. (eds) Recent Advances in Constraints. CSCLP 2004. Lecture Notes in Computer Science, vol 3419. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Alan Holland
    • 1
  • Barry O’Sullivan
    • 1
  1. 1.Cork Constraint Computation Centre, Department of Computer ScienceUniversity College CorkIreland

Personalised recommendations