By Topic

A partheno-genetic algorithm for optimal winner determination in combinatorial auctions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jian-Cong Bai ; Sch. of Information Sci. & Technol., Sun Yat-sen Univ., Guangzhou, China ; Hui-You Chang ; Yang Yi

Combinatorial auction is an efficient mechanism for allocating items among agents. And winner determination is the core problem in combinatorial auction. It is well known that the problem of determining the winners, so as to maximize revenue, is a NP-complete problem. In this paper, two fully expressive bidding languages are introduced firstly, namely XOR-bids and OR-bids, with which bidders can place additive or exclusive bids over collection of combinations. Meanwhile, some heuristic rules about the bidding languages are presented. Then with partheno-genetic operators and the fitting-first heuristic rules, a partheno-genetic algorithm is presented on the basis of the ideas of heuristic algorithm. The algorithm is simple for implementing and can achieve fine outcome to solve the winner determination problem without requiring complex operators of crossover and mutation. Simulation results show that the algorithm has very high feasibility and efficiency.

Published in:

Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on  (Volume:1 )

Date of Conference:

26-29 Aug. 2004