Stochastic Local Search for the Optimal Winner Determination Problem in Combinatorial Auctions

Authors:
Dalila Boughaci;Belaid Benhamou;Habiba Drias
Affiliations:
INCA/LSIS, CMI 39 rue Fredric Joliot-Curie Marseille, 130013;INCA/LSIS, CMI 39 rue Fredric Joliot-Curie Marseille, 130013;LRIA/USTHB- BP 32 El-Alia, Beb-Ezzoaur, Alger, Algérie 16111
Venue:
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Year:
2008

Citing 4
Cited 0

Computationally Manageable Combinational Auctions

Management Science
Solving Combinatorial Auctions Using Stochastic Local Search

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
An Intelligent Brokering System to Support Multi-Agent Web-Based 4th-Party Logistics

ICTAI '02 Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence
Heuristics for a bidding problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.