Abstract
In this paper, a stochastic local search (SLS) is studied for the optimal winner determination problem (WDP) in combinatorial auctions. Experiments on various realistic instances of the considered problem are performed to show and compare the effectiveness of our approach. The computational experiments show that the SLS provides competitive results and finds solutions of a higher quality than Tabu search and Casanova methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bean, J.C.: Genetics and random keys for sequencing and optimization. ORSA Journal of Computing 6(2), 154–160 (1994)
Guo, Y., Lim, A., Rodrigues, B., Zhu, Y.: Heuristics for a bidding problem. Computers and Operations Research 33(8), 2179–2188 (2006)
Hoos, H.H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: Proceedings of the 17th national conference on artificial intelligence, pp. 22–29 (2000)
Lau, H.C., Goh, Y.G.: An intelligent brokering system to support multi-agent web-based 4th-party logistics. In: Proceedings of the 14th international conference on tools with artificial intelligence, pp. 54–61 (2002)
Rothkopf, M.H., Pekee, A., Ronald, M.: Computationally manageable combinatorial auctions. Management Science 44(8), 1131–1147 (1998)
Sandholm, T.: Optimal Winner Determination Algorithms. In: Cramton, P., et al. (eds.) Combinatorial Auctions, MIT Press, Cambridge (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boughaci, D., Benhamou, B., Drias, H. (2008). Stochastic Local Search for the Optimal Winner Determination Problem in Combinatorial Auctions. In: Stuckey, P.J. (eds) Principles and Practice of Constraint Programming. CP 2008. Lecture Notes in Computer Science, vol 5202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85958-1_48
Download citation
DOI: https://doi.org/10.1007/978-3-540-85958-1_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85957-4
Online ISBN: 978-3-540-85958-1
eBook Packages: Computer ScienceComputer Science (R0)