Computationally Manageable Combinational Auctions
Management Science
iBundle: an efficient ascending price bundle auction
Proceedings of the 1st ACM conference on Electronic commerce
Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics
Proceedings of the 2nd ACM conference on Electronic commerce
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
An Algorithm for Multi-Unit Combinatorial Auctions
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
BOB: improved winner determination in combinatorial auctions and generalizations
Artificial Intelligence
On Heuristics for Solving Winner Determination Problem in Combinatorial Auctions
IAT '03 Proceedings of the IEEE/WIC International Conference on Intelligent Agent Technology
An Improved Search Technique for Optimal Winner Determination in Combinatorial Auctions
HICSS '04 Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3
Learning Bayesian network structures by searching for the best ordering with genetic algorithms
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
A novel genetic algorithm based on immunity
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hi-index | 0.01 |
Combinatorial auctions are efficient mechanisms for allocating resource in complex marketplace. Winner determination, which is NP-complete, is the core problem in combinatorial auctions. This paper proposes an immune partheno-genetic algorithm (IPGA) for solving this problem. Firstly, a zero-one programming model is built for the winner determination problem with XOR-bids and OR-bids. Then, steps of constructing three partheno-genetic operators and an immune operator are introduced. In the immune operation, new heuristics are designed for vaccines selection and vaccination. Simulation results show that the IPGA achieves good performance in large size problems and the immune operator can improve the searching ability and increase the converging speed greatly.