Super solutions for combinatorial auctions

Research output: Chapter in Book/Report/Conference proceedingsChapterpeer-review

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages187-200
Number of pages14
DOIs
Publication statusPublished - 2005
EventJoint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2004 - Lausanne, Switzerland
Duration: 23 Jun 200425 Jun 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3419 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceJoint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2004
Country/TerritorySwitzerland
CityLausanne
Period23/06/0425/06/04

Fingerprint

Dive into the research topics of 'Super solutions for combinatorial auctions'. Together they form a unique fingerprint.

Cite this