Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

CSCLP
2004
Springer

favoriteEmaildiscussreport

99views Artificial Intelligence» more CSCLP 2004»

Super Solutions for Combinatorial Auctions

13 years 10 months ago

Super Solutions for Combinatorial Auctions

Download liawww.epfl.ch

Super solutions provide a framework for ﬁnding 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 disqualiﬁed 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 ﬂexible and realistic approach for determining robust solutions.

Alan Holland, Barry O'Sullivan

Real-time Traffic

Constraint Satisfaction Problems | CSCLP 2004 | Robust Solutions | Super Solutions |

claim paper

Related Content

» Robust solutions for combinatorial auctions

» A Framework for Computing the Outcome of Proxied Combinatorial Auctions

» Iterative Combinatorial Auctions with Linear Prices Results of Numerical Experiments

» An algorithm for computing the outcome of combinatorial auctions with proxy bidding

» Envy Quotes and the Iterated CoreSelecting Combinatorial Auction

» Optimal solutions for multiunit combinatorial auctions branch and bound heuristics

» Cryptographic Combinatorial ClockProxy Auctions

» Computationallyefficient winner determination for mixed multiunit combinatorial auctions

» Bidding algorithms for a distributed combinatorial auction

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	CSCLP
Authors	Alan Holland, Barry O'Sullivan

Comments (0)