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. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Boughaci, D., Benhamou, B., & Drias, H. (2008). Stochastic local search for the optimal winner determination problem in combinatorial auctions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5202 LNCS, pp. 593–597). https://doi.org/10.1007/978-3-540-85958-1_48
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
