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.
This work has received funding from Science Foundation Ireland (Grant Number 00/Pl.1/C075) and from Enterprise Ireland, Research Innovation Fund (Grant Number RIF-2001-317).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bacchus, F., Katsirelos, G.: EFC constraint solver, http://www.cs.toronto.edu/~gkatsi/efc/efc.html
Epstein, R., Henríquez, L., Catalán, J., Weintraub, G.Y., Martínez, C.: A combinational auction improves school meals in Chile. Interfaces 32(6), 1–14 (2002)
Ginsberg, M.L., Parkes, A.J., Roy, A.: Supermodels and robustness. In: AAAI/IAAI, pp. 334–339 (1998)
Hebrand, E., Hnich, B., Walsh, T.: Robust solutions for constraint satisfaction and optimization. In: Proceedings of ECAI 2004 (2004)
Hebrard, E., Hnich, B., Walsh, T.: Super solutions in constraint programming. In: Régin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011. Springer, Heidelberg (2004)
Hohner, G., Rich, J., Ng, E., Reid, G., Davenport, A.J., Kalagnanam, J.R., Lee, H.S., An, C.: Combinatorial and quantity-discount procurement auctions benefit mars, incorporated and its suppliers. Interfaces 33(1), 23–35 (2003)
Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: ACM Conference on Electronic Commerce, pp. 66–76 (2000)
Milgrom, P.: Putting Auction Theory to Work, Cambridge (March 2004)
Pesendorfer, M., Cantillon, E.: Combination bidding in multi-unit auctions. Harvard Business School Working Draft (2003)
Sandholm, T.: Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence 135(1-2), 1–54 (2002)
Sandholm, T., Suri, S., Gilpin, A., Levine, D.: CABOB: A fast optimal algorithm for combinatorial auctions. In: IJCAI, pp. 1102–1108 (2001)
Walsh, W.E., Wellman, M.P., Ygge, F.: Combinatorial auctions for supply chain formation. In: ACM Conference on Electronic Commerce, pp. 260–269 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/11402763_14
Download citation
DOI: https://doi.org/10.1007/11402763_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25176-7
Online ISBN: 978-3-540-32252-8
eBook Packages: Computer ScienceComputer Science (R0)