A clique-based exact method for optimal winner determination in combinatorial auctions - Université d'Angers Accéder directement au contenu
Article Dans Une Revue Information Sciences Année : 2016

A clique-based exact method for optimal winner determination in combinatorial auctions

Résumé

Given a set of items to sell and a set of combinatorial bids, the Winner Determination Problem (WDP) in combinatorial auctions is to determine an allocation of items to bidders such that the auctioneer’s revenue is maximized while each item is allocated to at most one bidder. WDP is at the core of numerous relevant applications in multi-agent systems, e-commerce and many others. We develop a clique-based branch-and-bound approach for WDP which relies on a transformation of WDP into the maximum weight clique problem. To ensure the efficiency of the proposed search algorithm, we introduce specific bounding and branching strategies using a dedicated vertex coloring procedure and a specific vertex sorting technique. We assess the performance of the proposed algorithm on a large collection of benchmark instances in comparison with the CPLEX 12.4 solver and other approaches. Computational results show that this clique-based method constitutes a valuable and complementary approach for WDP relative to the existing methods.

Fichier principal
Vignette du fichier
wu2016.pdf (402.99 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01412529 , version 1 (16-06-2021)

Identifiants

Citer

Qinghua Wu, Jin-Kao Hao. A clique-based exact method for optimal winner determination in combinatorial auctions. Information Sciences, 2016, 334-335, pp.103-121. ⟨10.1016/j.ins.2015.11.029⟩. ⟨hal-01412529⟩

Collections

UNIV-ANGERS LERIA
26 Consultations
75 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More