Abstract
In this work, we are interested in the optimal winner determination problem (WDP) in combinatorial auctions. Given a set of bundles bids, the winner determination problem is to decide which of the bids to accept. More precisely, the WDP is finding an allocation that maximizes the auctioneer's revenue, subject to the constraint that each item can be allocated at most once. This paper tries to propose a hybrid parallel genetic algorithm for the winner determination problem.Experiments on realistic data sets of various sizes are performed to show and compare the effectiveness of our approach. © Springer-Verlag London Limited 2011.
Cite
CITATION STYLE
Boughaci, D., Slaouti, L., & Achour, K. (2011). A hybrid parallel genetic algorithm for the winner determination problem in combinatorial auctions. In Res. and Dev. in Intelligent Syst. XXVIII: Incorporating Applications and Innovations in Intel. Sys. XIX - AI 2011, 31st SGAI Int. Conf. on Innovative Techniques and Applications of Artificial Intel. (pp. 65–78). Springer London. https://doi.org/10.1007/978-1-4471-2318-7_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
